Results 21 to 30 of about 28,771 (269)
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
Two-stage Memetic Algorithm for Collaborative Decision Making of Emergency Resources Distribution [PDF]
Jisuanji gongcheng, 2016 Aiming at the influence of secondary disasters on resource distribution in emergency rescue,this paper proposes an algorithm for collaborative decision making of emergency resources distribution.Firstly,it takes minimizing the time to complete the ...
LIU Jie,ZHAO Lei
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
Trends in Computational and Applied Mathematics, 2018 In this paper, we deal with the Capacitated Lot Sizing and Scheduling Problem with sequencedependent setup times and costs - CLSD model. More specifically, we propose a simple reformulation for the CLSD model that enables us to define a new branching ...
Willy Alves de Oliveira +1 more
doaj +1 more source
Journal of Advanced Transportation, 2020 In the transportation industry, crew management is typically decomposed into two phases: crew scheduling and crew rostering. Due to the complexity of scheduling and rostering, bus transportation is not an exception and many relevant studies do not ...
Dung-Ying Lin +2 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
Energies, 2022 Aiming at the economic dispatch problem for an interconnected system with wind power integration, and in order to realize the goals of system economy and improvement of the cross-regional consumption level of wind energy, a decentralized coordination ...
Yuanyuan Wang +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
EVALUATION OF AIRBORNE L- BAND MULTI-BASELINE POL-INSAR FOR DEM EXTRACTION BENEATH FOREST CANOPY [PDF]
The International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences, 2018 DEM beneath forest canopy is difficult to extract with optical stereo pairs, InSAR and Pol-InSAR techniques. Tomographic SAR (TomoSAR) based on different penetration and view angles could reflect vertical structure and ground structure.
W. M. Li +4 more
doaj +1 more source