Keyword: branch-and-cut

Found 15 papers in total
A branch-price-and-cut algorithm for the min-max k-vehicle windy rural postman problem
A branch-price-and-cut algorithm for the min-max k-vehicle windy rural postman problem
2014,
The min‐max k‐vehicles windy rural postman problem consists of...
Combining Lift‐and‐Project and Reduce‐and‐Split
Combining Lift‐and‐Project and Reduce‐and‐Split
2013,
Split cuts constitute a class of cutting planes that has been successfully employed by...
New Lower Bounds and Exact Method for the m‐PVRP
New Lower Bounds and Exact Method for the m‐PVRP
2013,
This paper presents new lower bounding procedures and an exact method for the m...
A branch‐and‐cut algorithm for the Steiner tree problem with delays
A branch‐and‐cut algorithm for the Steiner tree problem with delays
2012,
In this paper, we investigate the Steiner tree problem with delays, which is a...
A Branch and Cut solver for the maximum stable set problem
A Branch and Cut solver for the maximum stable set problem
2011,
This paper deals with the cutting‐plane approach to the maximum stable set...
Orbitopal fixing
Orbitopal fixing
2011,
The topic of this paper are integer programming models in which a subset of...
A branch‐and‐cut algorithm based on semidefinite programming for the minimum k‐partition problem
A branch‐and‐cut algorithm based on semidefinite programming for the minimum k‐partition problem
2011,
The minimum k ‐partition (M k P) problem is the problem of partitioning the set...
Branch‐and‐cut with lazy separation for the vehicle routing problem with simultaneous pickup and delivery
Branch‐and‐cut with lazy separation for the vehicle routing problem with simultaneous pickup and delivery
2011,
We propose a branch‐and‐cut approach over a formulation with only the...
Valid inequalities and branch‐and‐cut for the clique pricing problem
Valid inequalities and branch‐and‐cut for the clique pricing problem
2011,
Motivated by an application in highway pricing, we consider the problem that consists...
The Robust Network Loading Problem Under Hose Demand Uncertainty: Formulation, Polyhedral Analysis, and Computations
The Robust Network Loading Problem Under Hose Demand Uncertainty: Formulation, Polyhedral Analysis, and Computations
2011,
We consider the network loading problem (NLP) under a polyhedral uncertainty...
A branch-and-price algorithm for the two-dimensional level strip packing problem
A branch-and-price algorithm for the two-dimensional level strip packing problem
2008,
The two–dimensional level strip packing problem (2LSPP) consists in packing...
The Ring Star problem: polyhedral analysis and exact algorithm
The Ring Star problem: polyhedral analysis and exact algorithm
2004,
In the Ring Star Problem, the aim is to locate a simple cycle through a subset of...
Introduction to ABACUS – a branch-and-cut system
Introduction to ABACUS – a branch-and-cut system
1998,
The software system ABACUS is an object-oriented framework for the implementation of...
A branch-and-cut method of 0–1 mixed convex programming
A branch-and-cut method of 0–1 mixed convex programming
1999,
We generalize the disjunctive approach of Balas, Ceria, and Cornuéjols and...
A branch-and-cut algorithm for the equicut problem
A branch-and-cut algorithm for the equicut problem
1997,
We describe an algorithm for solving the equicut problem on complete graphs. The core...
Papers per page: