Results 211 to 220 of about 14,097 (243)
Some of the next articles are maybe not open access.
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 +3 more sources
A polyhedral branch-and-cut approach to global optimization
Mathematical Programming, 2005zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Mohit Tawarmalani, Nikolaos V. Sahinidis
openaire +1 more source
A branch-and-cut algorithm for multiple sequence alignment
Mathematical Programming, 2005zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ernst Althaus +3 more
openaire +2 more sources
A branch-and-cut algorithm for vehicle routing problems
Annals of Operations Research, 1994zbMATH Open Web Interface contents unavailable due to conflicting licenses.
J. R. Araque G +3 more
openaire +2 more sources
A branch and cut heuristic for a runway scheduling problem
Automation and Remote Control, 2016zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Igor L. Vasilyev +2 more
openaire +3 more sources
Assembly System Design: A Branch and Cut Approach
Management Science, 1998This paper addresses the single-product assembly system design problem (ASDP), which seeks to minimize total cost by optimally integrating design (selecting the machine type to locate at each activated station) and operating issues (assigning tasks to observe precedence relationships and cycle time restrictions). We propose an effective branch-and-cut
Anulark Pinnoi, Wilbert E. Wilhelm
openaire +2 more sources
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 +5 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
A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
Operations Research, 2006In the dial-a-ride problem, users formulate requests for transportation from a specific origin to a specific destination. Transportation is carried out by vehicles providing a shared service. The problem consists of designing a set of minimum-cost vehicle routes satisfying capacity, duration, time window, pairing, precedence, and ride-time constraints.
openaire +2 more sources