Results 231 to 240 of about 143,487 (265)
Some of the next articles are maybe not open access.
A Branch-and-Cut Algorithm for the Median-Path Problem
Computational Optimization and Applications, 2005zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Pasquale Avella +3 more
openaire +3 more sources
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
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
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
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
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
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 +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 +4 more sources
The branch and cut method for the clique partitioning problem
Diskretnyi analiz i issledovanie operatsii, 2018Summary: A numerical study is carried out of the branch and cut method adapted for solving the clique partitioning problem (CPP). The problem is to find a family of pairwise disjoint cliques with minimum total weight in a complete edge-weighted graph.
Simanchev, R. Yu. +2 more
openaire +2 more sources