Branch-and-Price guided search

Authors:
Mike Hewitt;George L. Nemhauser;Martin Savelsbergh
Affiliations:
Department of Industrial and Systems Engineering, Rochester Institute of Technology;H. Milton Stewart School of Industrial and Systems Engineering, Georgia Institute of Technology;School of Mathematical and Physical Sciences, University of Newcastle, Australia
Venue:
ISCO'12 Proceedings of the Second international conference on Combinatorial Optimization
Year:
2012

Citing 6
Cited 0

Exploring relaxation induced neighborhoods to improve MIP solutions

Mathematical Programming: Series A and B
Robust Branch-and-Cut-and-Price for the Capacitated Vehicle Routing Problem

Mathematical Programming: Series A and B
An optimization algorithm for the inventory routing problem with continuous moves

Computers and Operations Research
An Optimization-Based Heuristic for the Split Delivery Vehicle Routing Problem

Transportation Science
Combining Exact and Heuristic Approaches for the Capacitated Fixed-Charge Network Flow Problem

INFORMS Journal on Computing
Branch-and-Price Guided Search for Integer Programs with an Application to the Multicommodity Fixed-Charge Network Flow Problem

INFORMS Journal on Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

When solving large-scale integer programming (IP) models, there are the conflicting goals of solution quality and solution time. Solving realistic-size instances of many problems to optimality is still beyond the capability of state-of-the-art solvers. However, by reducing the size of the solution space, such as by fixing variables, good primal solutions frequently can be found quickly.