Results 131 to 140 of about 140,088 (167)
Some of the next articles are maybe not open access.
Branch‐and‐cut algorithms for the ‐arborescence star problem
International Transactions in Operational Research, 2020AbstractGiven a connected digraph, a vertex designated as the root, and an integer , the ‐arborescence star problem is to choose vertices besides the root and define a reverse arborescence spanning them. Each vertex outside the arborescence must be assigned to one vertex inside it.
Armando Honorio Pereira +2 more
openaire +1 more source
2000
In this chapter, we describe the details of the implementation of a Branch-and-Cut algorithm for the 2CNBR problem. In Section 6.1, we address the problem of determining if a network is feasible. In Sections 6.2 to 6.8, we study the Separation problems for all the valid inequalities described in the previous chapters.
openaire +1 more source
In this chapter, we describe the details of the implementation of a Branch-and-Cut algorithm for the 2CNBR problem. In Section 6.1, we address the problem of determining if a network is feasible. In Sections 6.2 to 6.8, we study the Separation problems for all the valid inequalities described in the previous chapters.
openaire +1 more source
Solving Airline Crew Scheduling Problems by Branch-and-Cut
Management Science, 1993The crew scheduling problem is one that has been studied almost continually for the past 40 years but all prior approaches have always approximated the problem of finding an optimal schedule for even the smallest of an airline's fleets. The problem is especially important today since costs for flying personnel of major U.S. carriers have grown and now
Karla L. Hoffman, Manfred Padberg
openaire +2 more sources
A branch‐and‐cut algorithm for the preemptive swapping problem
Networks, 2009AbstractIn the swapping problem (SP), every vertex of a complete graph may supply and demand an object of a known type. A vehicle of unit capacity starting and ending its tour at an arbitrary vertex is available for carrying objects of given types between vertices.
Bordenave, Charles +2 more
openaire +2 more sources
Solving Real-World ATSP Instances by Branch-and-Cut
2003Recently, Fischetti, Lodi and Toth [15] surveyed exact methods for the Asymmetric Traveling Salesman Problem (ATSP) and computationally compared branch-and-bound and branch-and-cut codes. The results of this comparison proved that branch-and-cut is the most effective method to solve hard ATSP instances.
Fischetti M., Lodi A., Toth P.
openaire +2 more sources
Branch-and-Cut for the Maximum Feasible Subsystem Problem
SIAM Journal on Optimization, 2008Summary: This paper presents a branch-and-cut algorithm for the NP-hard maximum feasible subsystem problem: For a given infeasible linear inequality system, determine a feasible subsystem containing as many inequalities as possible. The complementary problem, where one has to remove as few inequalities as possible in order to make the system feasible ...
openaire +2 more sources
Model selection for learning Branch-and-cut strategies
Proceedings of the International Conference on Learning and Optimization Algorithms: Theory and Applications, 2018Branch-and-Cut algorithm is an omnipresent algorithm used for solving mixed integer linear problems (MILP). It is proving its efficiency in different fields such as multi commodity location routing [18] and vehicle routing problem [17]. As a matter of fact, it is a result of combining two algorithms that are branch-and-bound with cutting plane.
M. M. Kabbaj, A. El Afia
openaire +1 more source
Improving branch-and-cut performance by random sampling
Mathematical Programming Computation, 2015zbMATH Open Web Interface contents unavailable due to conflicting licenses.
FISCHETTI, MATTEO +4 more
openaire +4 more sources
Parallel branch and cut for capacitated vehicle routing
Parallel Computing, 2003Combinatorial optimization problems arise commonly in logistics applications. The most successful approaches to date for solving such problems involve modeling them as integer programs and then applying some variant of the branch and bound algorithm. Although branch and bound is conceptually easy to parallelize, achieving scalability can be a challenge.
openaire +1 more source