Results 251 to 260 of about 9,957 (290)
Metatranscriptomics analysis reveals the cotton virome in the southern United States. [PDF]
Sci RepEscalante C +17 more
europepmc +1 more source
Reinforcement learning-assisted distributionally robust energy management for multi-microgrid networks. [PDF]
Sci RepLi H +7 more
europepmc +1 more source
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.
Zdeněk Hanzálek, Přemysl Šůcha
exaly +4 more sources
A Branch-Price-and-Cut Algorithm for the Inventory-Routing Problem
Transportation Science, 2016The inventory-routing problem (IRP) integrates two well-studied problems, namely, inventory management and vehicle routing. Given a set of customers to service over a multiperiod horizon, the IRP consists of determining when to visit each customer, which quantity to deliver in each visit, and how to combine the visits in each period into feasible ...
Leandro C. Coelho, Guy Desaulniers
exaly +2 more sources
A branch-and-price algorithm for the multivehicle covering tour problem
Networks, 2014This article proposes a mathematical model and a branch-and-price algorithm for the multivehicle covering tour problem. This problem consists in finding a set of routes on a weighted graph such that a set of nodes that cannot be visited is covered. A node is covered if it lies within a predefined distance of a visited node.
Nicolas Jozefowiez
exaly +3 more sources
A branch‐and‐price algorithm for the capacitated p‐median problem
Networks, 2005 AbstractThe capacitated p‐median problem is the variation of the well‐known p‐median problem in which a demand is associated to each user, a capacity is associated to each candidate median, and the total demand of the users associated to the same median must not exceed its capacity.
A. Ceselli, G. Righini
openaire +4 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 +3 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.
Guy Desaulniers +2 more
openaire +1 more source
Using the primal-dual interior point algorithm within the branch-price-and-cut method [PDF]
Computers and Operations Research, 2013 Branch-price-and-cut has proven to be a powerful method for solving integer programming problems. It combines decomposition techniques with the generation of both columns and valid inequalities and relies on strong bounds to guide the search in the ...
Pedro Augusto Munari Júnior +1 more
exaly +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.
Dirk Briskorn, Andreas Drexl
openaire +1 more source