Results 271 to 280 of about 773,474 (304)
Some of the next articles are maybe not open access.
A Profit-Maximization Location-Routing-Pricing Problem: A Branch-and-Price Algorithm
European Journal of Operational Research, 2018zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ahmadi-Javid, Amir +2 more
openaire +1 more source
Improving Branch-and-Price for Parallel Machine Scheduling
2014In this paper we present a hybrid exact-heuristic method to improve a branch-and-price algorithm to solve the unrelated parallel machines with sequence-dependent setup times scheduling problem. As most of the computational time in the column generation (CG) process is spent in subproblems, two new heuristics to solve the subproblems are embedded in the
Lopes, Manuel +2 more
openaire +2 more sources
Improved Branch-Cut-and-Price for Capacitated Vehicle Routing
Mathematical Programming Computation, 2014zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Pecin, Diego +3 more
openaire +2 more sources
Branch, Cut, and Price: Sequential and Parallel
2001Branch, cut, and price (BCP) is an LP-based branch and bound technique for solving large-scale discrete optimization problems (DOPs). In BCP, both cuts and variables can be generated dynamically throughout the search tree. The ability to handle constantly changing sets of cuts and variables allows these algorithms to undertake the solution of very ...
Laszlo Ladányi +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-Cut-and-Price for Capacitated Connected Facility Location
Journal of Mathematical Modelling and Algorithms, 2011zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Leitner, Markus, Raidl, Günther R.
openaire +2 more sources
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
Branch-and-price-and-cut methods for the electric vehicle routing problem with time windows
International Journal of Production Research, 2022Ece Duman, Duygu TaŞ, BÜlent Çatay
exaly