## Combinatorial optimization: new frontiers in theory and practice |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### 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

### Common terms and phrases

82 Combinatorial Optimization 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 due date edges efficient excess scaling algorithm feasible permutation feasible solution Fibonacci heaps finite formulation given graph Hamacher heuristic implementation integer programming iteration knapsack problem label Lageweg Lemma linear programming lower bound matching problems Mathematical Programming matrix network flow node objective function obtained Operations Research optimal sequence optimal solution partitioning pivot polynomial precedence constraints preference order primal procedure processing relaxation robot 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