Abstract
Part I: General methodologies complexity and approximability polyhedral combinatorics branch-and-cut algorithms matroids and submodular functions advances in linear programming decomposition and column generation stochastic integer programming randomized algorithms local search graphs and matrices. Part II: Specific topics and applications sequencing and scheduling Travelling Salesman Problem max cut location problems network design flows and paths quadratic and 3-dimensional assignments linear assignment vehicle routing cutting and packing combinatorial topics in VLSI design applications in computational biology.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
