Combinatorial Optimization

Table of Contents

1. Altmetric Badge
   Book Overview
2. Altmetric Badge
   Chapter 1 Variable Decomposition, Constraint Decomposition and Cross Decomposition in General Mathematical Programming
3. Altmetric Badge
   Chapter 2 Surrogate Constraint Methods for Linear Inequalities
4. Altmetric Badge
   Chapter 3 An Evaluation of Algorithmic Refinements and Proper Data Structures for the Preflow-Push Approach for Maximum Flow
5. Altmetric Badge
   Chapter 4 A Cutting Plane Algorithm for the Single Machine Scheduling Problem with Release Times
6. Altmetric Badge
   Chapter 5 The Linear Assignment Problem
7. Altmetric Badge
   Chapter 6 Cost Allocation In The Oil Industry: An Example
8. Altmetric Badge
   Chapter 7 On Preference Orders for Sequencing Problems Or, What Hath Smith Wrought?
9. Altmetric Badge
   Chapter 8 Dynamic Basis Partitioning for Network Flows with Side Constraints
10. Altmetric Badge
    Chapter 9 Combinatorial Optimization Models Motivated by Robotic Assembly Problems
11. Altmetric Badge
    Chapter 10 Job Shop Scheduling
12. Altmetric Badge
    Chapter 11 On the Construction of the Set of K-best Matchings and Their Use in Solving Constrained Matching Problems
13. Altmetric Badge
    Chapter 12 Solving Large Scale Multicommodity Networks Using Linear—Quadratic Penalty Functions
14. Altmetric Badge
    Chapter 13 An Analysis of the Minimal Spanning Tree Structure
15. Altmetric Badge
    Chapter 14 Genetic Algorithms: A New Approach to the Timetable Problem
16. Altmetric Badge
    Chapter 15 A New Approximation Technique for Hypergraph Partitioning Problem
17. Altmetric Badge
    Chapter 16 Optimal Location of Concentrators in a Centralized Teleprocessing Network
18. Altmetric Badge
    Chapter 17 A Column Generation Algorithm for the Vehicle Routing Problem with Time Windows
19. Altmetric Badge
    Chapter 18 The Linear Complementary Problem, Sufficient Matrices and the Criss-Cross Method
20. Altmetric Badge
    Chapter 19 A Characterization of Lifted-Cover Facets of Knapsack Polytope with GUB Constraints
21. Altmetric Badge
    Chapter 20 On Pleasant Knapsack Problems
22. Altmetric Badge
    Chapter 21 Extensions of Efficient Exact Solution Procedures to Bicriterion Optimization
23. Altmetric Badge
    Chapter 22 Combinatorial Aspects in Single Junction Control Optimization
24. Altmetric Badge
    Chapter 23 Approximation Algorithms for Constrained Scheduling
25. Altmetric Badge
    Chapter 24 An Analogue of Hoffman’s Circulation Conditions for Max-Balanced Flows
26. Altmetric Badge
    Chapter 25 Some Telecommunications Network Design Problems and the Bi-Steiner Problem
27. Altmetric Badge
    Chapter 26 Parallel Machine Scheduling to Minimize Costs for Earliness and Number of Tardy Jobs
28. Altmetric Badge
    Chapter 27 Exact Solution of Multiple Traveling Salesman Problems
29. Altmetric Badge
    Chapter 28 A Nonlinear Two-Stage Cutting Stock Problem
30. Altmetric Badge
    Chapter 29 The Probabilistic Behavior of the Generalized HARMONIC Algorithm for the On-Line Multi-Dimensional Bin Packing
31. Altmetric Badge
    Chapter 30 Efficient Labelling Algorithms for the Maximum Noncrossing Matching Problem
32. Altmetric Badge
    Chapter 31 A Phase I That Solves Transportation Problems
33. Altmetric Badge
    Chapter 32 A Polynomially Bounded Dual Simplex Algorithm for Capacitated Minimum Cost Flow Problem
34. Altmetric Badge
    Chapter 33 Formulation and a Lagrangean Relaxation Procedure for Solving Part Scheduling and Tool Loading Problems in FMS
35. Altmetric Badge
    Chapter 34 Euclidean Steiner Minimal Trees with Obstacles and Steiner Visibility Graphs
36. Altmetric Badge
    Chapter 35 A Set Covering Formulation of the Matrix Equipartition Problem
37. Altmetric Badge
    Chapter 36 Maximizing a Submodular Function by Integer Programming: A Polyhedral Approach
38. Altmetric Badge
    Chapter 37 New Bounds for the Asymmetric Traveling Salesman Problem
39. Altmetric Badge
    Chapter 38 A Lagrangean Heuristic for Set Covering Problems