Results 241 to 250 of about 979,870 (292)
Some of the next articles are maybe not open access.
Cutting planes for branch‐and‐price algorithms
Networks, 2011AbstractThis article presents a general framework for formulating cutting planes in the context of column generation for integer programs. Valid inequalities can be derived using the variables of an equivalent compact formulation (i.e., the subproblem variables) or the master problem variables.
Desaulniers, Guy +2 more
openaire +1 more source
2010
This chapter focuses on the approach for solving the LOP to optimality which can currently be seen as the most successful one. It is a branch-and-bound algorithm, where the upper bounds are computed using linear programming relax- ations.
Rafael Martí, Gerhard Reinelt
openaire +1 more source
This chapter focuses on the approach for solving the LOP to optimality which can currently be seen as the most successful one. It is a branch-and-bound algorithm, where the upper bounds are computed using linear programming relax- ations.
Rafael Martí, Gerhard Reinelt
openaire +1 more source
1996
Abstract As is frequently the case for MIP, instead of attempting to optimize (1.3) directly over P, it may be advantageous to divide that region into a finite number of smaller regions and optimize the objective function over each smaller region individually.
Abilio Lucena, John E Beasley
openaire +1 more source
Abstract As is frequently the case for MIP, instead of attempting to optimize (1.3) directly over P, it may be advantageous to divide that region into a finite number of smaller regions and optimize the objective function over each smaller region individually.
Abilio Lucena, John E Beasley
openaire +1 more source
A note on branch-and-cut-and-price
Operations Research Letters, 2010zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Feillet, Dominique +3 more
openaire +3 more sources
Solving the Orienteering Problem through Branch-and-Cut
INFORMS Journal on Computing, 1998In the Orienteering Problem (OP), we are given an undirected graph with edge weights and node prizes. The problem calls for a simple cycle whose total edge weight does not exceed a given threshold, while visiting a subset of nodes with maximum total prize. This NP-hard problem arises in routing and scheduling applications. We describe a branch-and-cut
FISCHETTI, MATTEO +2 more
openaire +3 more sources
Classical cuts for mixed-integer programming and branch-and-cut
Mathematical Methods of Operations Research (ZOR), 2001zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
Degeneracy of Resonances: Branch Point and Branch Cuts in Parameter Space
International Journal of Theoretical Physics, 2007zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hernández, E. +3 more
openaire +2 more sources
Declawing a graph: polyhedra and Branch-and-Cut algorithms
Journal of Combinatorial Optimization, 2021zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Felipe C. Fragoso +2 more
openaire +1 more source