Integer Programming and Combinatorial Optimization: 10th International IPCO Conference, New York, NY, USA, June 7-11, 2004, Proceedings
George Nemhauser, Daniel Bienstock
Springer, Aug 5, 2004 - Computers - 445 pages
This book constitutes the refereed proceedings of the 10th International Conference on Integer Programming and Combinatorial Optimization, IPCO 2004, held in New York City, USA in June 2004. The 32 revised papers presented were carefully reviewed and selected from 109 submissions. Among the topics addressed are vehicle routing, network management, mixed-integer programming, computational complexity, game theory, supply chain management, stochastic optimization problems, production scheduling, graph computations, computational graph theory, separation algorithms, local search, linear optimization, integer programming, graph coloring, packing, combinatorial optimization, routing, flow algorithms, 0/1 polytopes, and polyhedra.
What people are saying - Write a review
We haven't found any reviews in the usual places.
R Pukasawa J Lysgaard M Poggi de Aragao M Reis E Uchoa
Valid Inequalities Based on Simple MixedInteger Sets
25 other sections not shown
Other editions - View all
acyclic approximation algorithms arcs assigned Bienstock and G binary branch-and-cut capacitated capacitated facility location capacity client cluster coefficients Combinatorial Optimization components Computer concave cocirculation consider contains convex corresponding Cplex cut-tree cycle decomposition defined demand denote digraph directed graph Discrete dual solution edges exists facility location problem feasible solution flow problem formulation fractional given graph G heuristic honeycomb implies instances integer program IPCO latency Lemma linear programming LNCS lower bound LP relaxation M-convex Math matrix maximal maximum latency Metric Inequalities min-max minimal minimum mixed-integer multicommodity Nash equilibrium Nemhauser Eds node NP-hard objective function obtained Operations Research optimal solution partition path polyhedral polyhedron polynomial polytope precedence constraints Proof prove ratio satisfies scenario schedule Section semi-continuous solve Steiner trees stochastic strongly connected subgraph subset supernode symmetric Theorem tight tree upper bound variables vector vertex set vertices W-matching weight