Results 251 to 260 of about 124,219 (294)
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Accelerating the Branch-and-Price Algorithm Using Machine Learning
European Journal of Operational Research, 2018zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Roman Václavík +3 more
openaire +4 more sources
Constrained shortest path tour problem: Branch-and-Price algorithm
Computers & Operations Research, 2022zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Martin, Sébastien +3 more
openaire +2 more sources
A Branch-and-Price Algorithm for the Multiple Knapsack Problem
INFORMS Journal on Computing, 2022The multiple knapsack problem is a well-studied combinatorial optimization problem with several practical and theoretical applications. It consists of packing some subset of n items into m knapsacks such that the total profit of the chosen items is maximum. A new formulation of the problem is presented, where a Lagrangian relaxation is derived, and we
Olivier Lalonde +2 more
openaire +2 more sources
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
A branch‐and‐price algorithm for switch‐box routing
Networks, 2002AbstractRouting in VLSI design concerns the wiring of a chip after the logical modules have been placed. A subproblem occurring in VLSI design is switch‐box routing. Switch‐box routing can be formulated as the problem of packing Steiner trees in a grid graph. The only previous exact solution method for switch‐box routing uses a branch‐and‐cut approach.
Jørgensen, David Grove, Meyling, Morten
openaire +2 more sources
A branch-and-price algorithm for scheduling sport leagues
Journal of the Operational Research Society, 2009Round robin tournaments (RRTs) cover a huge variety of different types of sports league schedules arising in practice. The focus in this paper is on single RRTs where scheduling is temporally constrained, which means that matches have to be scheduled in a given minimum number of periods. We consider a set T of n teams.
D. Briskorn, A. Drexl
openaire +1 more source
Branch-and-price algorithm for a multicast routing problem
Journal of the Operational Research Society, 1999Summary: This paper considers a multicast routing problem to find the minimum cost tree where the whole communication link delay on each path (route) of the tree is subject to a given delay allowance. The problem is formulated as an integer programming problem by using path variables.
Sung, C. S., Hong, J. M.
openaire +1 more source
Primal Heuristics for Branch-and-Price Algorithms
2012In this paper, we present several primal heuristics which we implemented in the branch-and-price solver GCG based on the SCIP framework. This involves new heuristics as well as heuristics from the literature that make use of the reformulation yielded by the Dantzig-Wolfe decomposition.
Marco Lübbecke, Christian Puchert
openaire +1 more source
Network interdiction via a Critical Disruption Path: Branch-and-Price algorithms
Computers & Operations Research, 2013zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Granata Donatella +2 more
openaire +4 more sources