Results 21 to 30 of about 16,265 (145)
A Branch-and-Cut algorithm for graph coloring
Discrete Applied Mathematics, 2006 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Méndez-Díaz, I., Zabala, P.
openaire +4 more sources
EURO Journal on Computational Optimization, 2017 The generalized directed rural postman problem is an arc routing problem with many interesting real-life applications, such as routing for meter reading. In this application, a vehicle with a receiver travels through a series of neighborhoods.
Thais Ávila +3 more
doaj +1 more source
Engineering Branch-and-Cut Algorithms for the Equicut Problem [PDF]
, 2013 A minimum equicut of an edge-weighted graph is a partition of the nodes of the graph into two sets of equal size such that the sum of the weights of edges joining nodes in different partitions is minimum. We compare basic linear and semidefinite relaxations for the equicut problem, and find that linear bounds are competitive with the corresponding ...
Anjos, Miguel F. +3 more
openaire +3 more sources
Mathematical Modeling and Optimal Blank Generation in Glass Manufacturing
Journal of Applied Mathematics, 2014 This paper discusses the stock size selection problem (Chambers and Dyson, 1976), which is of relevance in the float glass industry. Given a fixed integer N, generally between 2 and 6 (but potentially larger), we find the N best sizes for intermediate ...
Raymond Phillips +3 more
doaj +1 more source
A branch-and-cut algorithm for multiple sequence alignment
Proceedings of the first annual international conference on Computational molecular biology - RECOMB '97, 1997 We consider a branch-and-cut approach for solving the multiple sequence alignment problem, which is a central problem in computational biology. We propose a general model for this problem in which arbitrary gap costs are allowed. An interesting aspect of our approach is that the three (exponentially large) classes of natural valid inequalities that we ...
Reinert, K. +4 more
openaire +3 more sources
Branch-and-Cut-and-Price algorithms for the preemptive RCPSP [PDF]
RAIRO - Operations Research, 2018 In this article, we address the preemptive Resource-Constrained Precedence Scheduling Problem. We propose two mixed integer formulations containing an exponential number of variables and inequalities. An antichain is a set of pairwise incomparable elements with respect to the precedence constraints.
Fouilhoux, Pierre +3 more
openaire +2 more sources
A Comparison of Algorithms for Finding an Efficient Theme Park Tour
Journal of Applied Mathematics, 2018 The problem of efficiently touring a theme park so as to minimize the amount of time spent in queues is an instance of the Traveling Salesman Problem with Time-Dependent Service Times (TSP-TS). In this paper, we present a mixed-integer linear programming
Elizabeth L. Bouzarth +6 more
doaj +1 more source
Rearrangement of DNA fragments: a branch-and-cut algorithm
Discrete Applied Mathematics, 2002 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ferreira, C.E. +2 more
openaire +2 more sources
Graph-Based Multicell Scheduling in OFDMA-Based Small Cell Networks
IEEE Access, 2014 This paper proposes a novel graph-based multicell scheduling framework to efficiently mitigate downlink intercell interference in OFDMA-based small cell networks.
Emmanouil Pateromichelakis +3 more
doaj +1 more source
A branch‐and‐cut algorithm for the ring spur assignment problem [PDF]
Networks, 2013 AbstractThe ring spur assignment problem arises in the design of next‐generation telecommunications networks and has applications in location‐allocation problems. The aim is to identify a minimum cost set of interconnected ring spurs. We seek to connect all nodes of the network either on a set of bounded disjoint local rings or by a single spur edge ...
Carroll, Paula +3 more
openaire +4 more sources