Results 261 to 270 of about 9,957 (290)
Some of the next articles are maybe not open access.
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.
David Grove Jørgensen, Morten Meyling
openaire +3 more sources
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.
C. S. Sung, J. M. Hong
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 E. Lübbecke, Christian Puchert
openaire +2 more sources
A Branch-and-Price algorithm for a compressor scheduling problem
Computers & Industrial Engineering, 2018Abstract This work presents a Branch-and-Price algorithm for solving a compressor scheduling problem with applications in oil production. The problem consists in defining a set of compressors to be installed for supplying the gas-lift demand of oil wells while minimizing the associated costs.
Marcelo Wuttig Friske +2 more
openaire +1 more source
A Branch-and-Price Algorithm for the Generalized Assignment Problem
Operations Research, 1997The generalized assignment problem examines the maximum profit assignment of jobs to agents such that each job is assigned to precisely one agent subject to capacity restrictions on the agents. A new algorithm for the generalized assignment problem is presented that employs both column generation and branch-and-bound to obtain optimal integer ...
openaire +2 more sources
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.
Amir Ahmadi-Javid +2 more
openaire +2 more sources
An Exact Branch-and-Price Algorithm for Workforce Scheduling
2005We consider a generic workforce scheduling problem, where employees are characterized by qualifications. Given a set of shifts for each day, we have to determine for each employee his working days as well as a specific shift for each working day. The overall objective is to find a set of feasible schedules with respect to hard and soft restrictions. We
Christoph Stark, Jürgen Zimmermann 0001
openaire +1 more source
A Branch-and-Price Algorithm for the Multilevel Generalized Assignment Problem
Operations Research, 2006The multilevel generalized assignment problem (MGAP) is a variation of the generalized assignment problem, in which agents can execute tasks at different efficiency levels with different costs. We present a branch-and-price algorithm that is the first exact algorithm for the MGAP.
A. Ceselli, G. Righini
openaire +1 more source
A branch-and-price algorithm for the Steiner tree packing problem
Computers & Operations Research, 2002zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jeong, GW +3 more
openaire +2 more sources
A branch-and-price algorithm for capacitated hypergraph vertex separation
Mathematical Programming Computation, 2019zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Michael Bastubbe, Marco E. Lübbecke
openaire +3 more sources