Combinatorial Optimization: New Frontiers in Theory and PracticeM. Akgül, Horst Hamacher, Süleyman Tüfekçi |
Contents
Variable Decomposition Constraint Decomposition | 1 |
Surrogate Constraint Methods for Linear Inequalities | 19 |
An Evaluation of Algorithmic Refinements and Proper Data Structures | 39 |
Copyright | |
15 other sections not shown
Other editions - View all
Combinatorial Optimization: New Frontiers in Theory and Practice Mustafa Akgül,Horst W. Hamacher,Süleyman Tüfekci No preview available - 2011 |
Combinatorial Optimization Mustafa Akgul,Horst W Hamacher,Suleyman Tufekci No preview available - 1992 |
Common terms and phrases
82 Combinatorial Optimization Akgül alternating tree applied assignment problem augmenting path Berlin Heidelberg 1992 Bilkent University branch and bound capacity column Combinatorial Optimization Combinatorial Optimization Edited cost Cross Decomposition data structure defined denote dual variables dual-feasible edges efficient feasible solution finite formulation graph Hamacher heuristic implementation integer programming iteration K-best knapsack problem label Lemma linear programming lower bound M₁ matching problems Mathematical Programming matrix method NATO network flow node NP-hard O(n² objective function obtained Operations Research optimal sequence optimal solution partitioning pivot polynomial precedence constraints preference order primal procedure processing relaxation rooted scheduling problem series parallel shortest path shortest path problem simplex algorithm single machine sink node solving source node Springer-Verlag Berlin Heidelberg strongly feasible tree subproblem subset subtree surrogate constraint Theorem traveling salesman problem updating upper bound valid inequalities vector