Results 281 to 290 of about 76,469 (342)
Some of the next articles are maybe not open access.
Branch and Price for Chance-Constrained Bin Packing
INFORMS Journal on Computing, 2020This article describes two versions of the chance-constrained stochastic bin-packing (CCSBP) problem that consider item-to-bin allocation decisions in the context of chance constraints on the total item size within the bins. The first version is a stochastic CCSBP (SP-CCSBP) problem, which assumes that the distributions of item sizes are known.
Zhang, Zheng +2 more
openaire +3 more sources
A branch-and-price-and-cut algorithm for the unmanned aerial vehicle delivery with battery swapping
International Journal of Production ResearchIn the UAV-based urban delivery setting, the battery capacity serves as one of the key factors affecting the delivery range of drones. For a typical multi-rotor unmanned aerial vehicle (UAV), the maximum effective working range of a lithium battery for a
Zhi Pei +3 more
semanticscholar +1 more source
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 +2 more sources
Sorting Permutations by Reversals Through Branch-and-Price
INFORMS Journal on Computing, 2001We describe an exact algorithm for the problem of sorting a permutation by the minimum number of reversals, originating from evolutionary studies in molecular biology. Our approach is based on an integer linear programming formulation of a graph-theoretic relaxation of the problem, calling for a decomposition of the edge set of a bicolored graph into ...
CAPRARA A., LANCIA, Giuseppe, NG S. K.
openaire +3 more sources
A Branch and Price Algorithm for Crane Assignment and Scheduling in Slab Yard
IEEE Transactions on Automation Science and Engineering, 2021In a steel industry, a slab yard plays a role of a buffer between continuous casting stage and rolling mill. An effective assignment and scheduling of cranes can guarantee the operation efficiency in the slab yard.
Xu Wang +5 more
semanticscholar +1 more source
Stabilizing branch‐and‐price for constrained tree problems
Networks, 2012AbstractWe consider a rather generic class of network design problems in which a set or subset of given terminal nodes must be connected to a dedicated root node by simple paths and a variety of resource and/or quality of service constraints must be respected.
Markus Leitner +2 more
openaire +2 more sources
INFORMS journal on computing, 2021
A capacitated vehicle routing problem with two-dimensional loading constraints is addressed. Associated with each customer are a set of rectangular items, the total weight of the items, and a time window.
Xiang-Yi Zhang +3 more
semanticscholar +1 more source
A capacitated vehicle routing problem with two-dimensional loading constraints is addressed. Associated with each customer are a set of rectangular items, the total weight of the items, and a time window.
Xiang-Yi Zhang +3 more
semanticscholar +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 approach for the partition coloring problem
Operations Research Letters, 2011zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Edna Ayako Hoshino +2 more
openaire +4 more sources
Proceedings of the ... International Conference on Automated Planning and Scheduling
The Moving Target Vehicle Routing Problem (MT-VRP) seeks trajectories for several agents that intercept a set of moving targets, subject to speed, time window, and capacity constraints.
Anoop Bhat +4 more
semanticscholar +1 more source
The Moving Target Vehicle Routing Problem (MT-VRP) seeks trajectories for several agents that intercept a set of moving targets, subject to speed, time window, and capacity constraints.
Anoop Bhat +4 more
semanticscholar +1 more source