Open AccessBook
Integer Programming and Combinatorial Optimization: 10th International IPCO Conference, New York, NY, USA, June 7-11, 2004, Proceedings
Daniel Bienstock,George Nemhause +1 more
- 24 May 2004
10
TL;DR: In this paper, a branch-and-cut and price algorithm for the Capacitated vehicle Routing problem is presented, as well as a robust optimization approach to supply chain management.
read more
Abstract: Session 1.- Robust Branch-and-Cut-and-Price for the Capacitated Vehicle Routing Problem.- Metric Inequalities and the Network Loading Problem.- Valid Inequalities Based on Simple Mixed-Integer Sets.- Session 2.- The Price of Anarchy when Costs Are Non-separable and Asymmetric.- Computational Complexity, Fairness, and the Price of Anarchy of the Maximum Latency Problem.- Polynomial Time Algorithm for Determining Optimal Strategies in Cyclic Games.- Session 3.- A Robust Optimization Approach to Supply Chain Management.- Hedging Uncertainty: Approximation Algorithms for Stochastic Optimization Problems.- Scheduling an Industrial Production Facility.- Session 4.- Three Min-Max Theorems Concerning Cyclic Orders of Strong Digraphs.- A TDI Description of Restricted 2-Matching Polytopes.- Enumerating Minimal Dicuts and Strongly Connected Subgraphs and Related Geometric Problems.- Session 5.- Semi-continuous Cuts for Mixed-Integer Programming.- Combinatorial Benders' Cuts.- A Faster Exact Separation Algorithm for Blossom Inequalities.- Session 6.- LP-based Approximation Algorithms for Capacitated Facility Location.- A Multi-exchange Local Search Algorithm for the Capacitated Facility Location Problem.- Separable Concave Optimization Approximately Equals Piecewise Linear Optimization.- Session 7.- Three Kinds of Integer Programming Algorithms Based on Barvinok's Rational Functions.- The Path-Packing Structure of Graphs.- More on a Binary-Encoded Coloring Formulation.- Session 8.- Single Machine Scheduling with Precedence Constraints.- The Constrained Minimum Weighted Sum of Job Completion Times Problem.- Session 9.- Near-Optimum Global Routing with Coupling, Delay Bounds, and Power Consumption.- A Flow-Based Method for Improving the Expansion or Conductance of Graph Cuts.- All Rational Polytopes Are Transportation Polytopes and All Polytopal Integer Sets Are Contingency Tables.- Session 10.- A Capacity Scaling Algorithm for M-convex Submodular Flow.- Integer Concave Cocirculations and Honeycombs.- Minsquare Factors and Maxfix Covers of Graphs.- Session 11.- Low-Dimensional Faces of Random 0/1-Polytopes.- On Polyhedra Related to Even Factors.- Optimizing over Semimetric Polytopes.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Projection results for vehicle routing
TL;DR: A survey of formulations for the capacitated VRP, and various results of a similar flavour to those of Gouveia are presented, which show that the three-index formulation, augmented by certain families of valid inequalities, gives the same lower bound as the two- Index formulation, and the set partitioning formulation implies by projection both multistar and hypotour-like inequalities in theTwo-index space.
132
Recent techniques and results on the Erdős–Pósa property
Jean-Florent Raymond,Jean-Florent Raymond,Jean-Florent Raymond,Dimitrios M. Thilikos,Dimitrios M. Thilikos +4 more
TL;DR: Some recent techniques for proving the Erdős–Posa property, which reveals a connection between packing and covering problems on graphs, are described and an unified presentation of the current state of the art is provided.
70
Benders decomposition approach for the robust network design problem with flow bifurcations
TL;DR: It is shown that the robust version of the Benders subproblem can be formulated as a linear program whose size is polynomially bounded and demonstrated that robust solutions with very small penalties in the objective values can be obtained.
A two-phase relaxation-based heuristic for the maximum feasible subsystem problem
TL;DR: Computational results indicate that the proposed two-phase relaxation-based heuristic for the maximum feasible subsystem problem compares well with one of the best available heuristics and with state-of-the-art exact algorithms.
24
RC-aware global routing
Rudolf Scheifele
- 07 Nov 2016
TL;DR: An algorithm for routing a single net with the objective of minimizing the weighted sum of congestion costs and Elmore delays to the sinks and a timing relaxation method that allows to obtain good timing results without producing overcongestion on designs where meeting timing closure is not possible is presented.
11
References
Projection results for vehicle routing
TL;DR: A survey of formulations for the capacitated VRP, and various results of a similar flavour to those of Gouveia are presented, which show that the three-index formulation, augmented by certain families of valid inequalities, gives the same lower bound as the two- Index formulation, and the set partitioning formulation implies by projection both multistar and hypotour-like inequalities in theTwo-index space.
132
A two-phase relaxation-based heuristic for the maximum feasible subsystem problem
TL;DR: Computational results indicate that the proposed two-phase relaxation-based heuristic for the maximum feasible subsystem problem compares well with one of the best available heuristics and with state-of-the-art exact algorithms.
24
RC-aware global routing
Rudolf Scheifele
- 07 Nov 2016
TL;DR: An algorithm for routing a single net with the objective of minimizing the weighted sum of congestion costs and Elmore delays to the sinks and a timing relaxation method that allows to obtain good timing results without producing overcongestion on designs where meeting timing closure is not possible is presented.
11
Efficient Network Coding packet selection model for QoS-based applications
Samih Abdul-Nabi,Ayman Khalil,Jean-François Hélard +2 more
- 01 Jul 2013
TL;DR: A novel NC algorithm is used to select, among received packets, those to be coded and released into the network and it enhances the coding decision and guarantees decodability of transmitted packets.
5
A Hybrid Relax-and-Cut/Branch and Cut Algorithm for the Degree-Constrained Minimum Spanning Tree Problem ⁄
Alexandre Salles da Cunha,Abilio Lucena +1 more
- 01 Jan 2008
TL;DR: A new exact solution algorithm is proposed for the Degree-Constrained Minimum Spanning Tree Problem that dominates similar hybrid algorithms based on the standard formulation alone and also dominates pure Branch and Cut algorithmsbased on either the standard formulations or its Blossom Inequalities reinforced version.
3