Results 41 to 50 of about 140,088 (167)

Branch and cut methods for network optimization

open access: yesMathematical and Computer Modelling, 2001
This paper contains a survey on the use of the Branch and Cut technique for solving network related combinatorial optimization problems. After an introductory section, a description in general terms is given of the Branch and Cut methodology and of the ``separation problem'', including also a discussion on advantages and disadvantages of the technique.
Caccetta, L., Hill, S. P.
openaire   +2 more sources

A branch‐and‐cut algorithm for the Team Orienteering Problem [PDF]

open access: yesInternational Transactions in Operational Research, 2017
AbstractThe Team Orienteering Problem aims at maximizing the total amount of profit collected by a fleet of vehicles while not exceeding a predefined travel time limit on each vehicle. In the last years, several exact methods based on different mathematical formulations were proposed.
Bianchessi, Nicola   +2 more
openaire   +4 more sources

Integrated Crew Scheduling and Roster Problem for Trainmasters of Passenger Railway Transportation

open access: yesIEEE Access, 2019
Train crew management is an imperative task in a passenger railway system and is typically decomposed into two sub-problems: crew scheduling problem and crew rostering problem.
Dung-Ying Lin, Meng-Rung Tsai
doaj   +1 more source

Proximal Branching of the Anterior Tibial Artery From the Popliteal Artery Increases the Risk of Vascular Injury During Total Knee Arthroplasty: A Retrospective Analysis Using Preoperative Magnetic Resonance Imaging and Intraoperative Findings

open access: yesGeriatric Orthopaedic Surgery & Rehabilitation, 2022
Introduction Arterial injury following total knee arthroplasty (TKA) can be life-threatening. There are some anatomical variations in the popliteal artery (PA) and its branches.
Yuya Kimura MD   +3 more
doaj   +1 more source

Balanced vehicle routing: Polyhedral analysis and branch-and-cut algorithm [PDF]

open access: yesEuropean Journal of Operational Research, 2019
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Tolga Bektaş   +3 more
openaire   +4 more sources

The structure of the South-Central-Pyrenean fold and thrust belt as constrained by subsurface data

open access: yesGeologica Acta, 2018
The interpretation of the available seismic lines of the South-Central-Pyrenean fold and thrust belt, conveniently tied with the exploration wells, define the main structural features of this realm of the Pyrenees.
J.A. MUÑOZ   +6 more
doaj  

The Fruitless Branch and the Eternal Security of the Believer

open access: yesE-Journal of Religious and Theological Studies, 2022
The quest for the identification of the fruitless branch has been an enduring theological battleground between the Calvinists and the Arminians who argue as to whether or not the removal of the fruitless branch indicates the loss of eternal salvation.
Anthony Yaw Badu   +1 more
doaj   +1 more source

Branch-and-Cut-and-Price for Multi-Agent Pathfinding [PDF]

open access: yesProceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019
There are currently two broad strategies for optimal Multi-agent Pathfinding (MAPF): (1) search-based methods, which model and solve MAPF directly, and (2) compilation-based solvers, which reduce MAPF to instances of well-known combinatorial problems, and thus, can benefit from advances in solver techniques.
Edward Lam   +3 more
openaire   +2 more sources

Critical evaluation of branch polarity and apical dominance as dictators of colony astogeny in a branching coral. [PDF]

open access: yesPLoS ONE, 2009
The high morphological resemblance between branching corals and trees, can lead to comparative studies on pattern formation traits, best exemplified in plants and in some cnidarians.
Lee Shaish, Baruch Rinkevich
doaj   +1 more source

Engineering Branch-and-Cut Algorithms for the Equicut Problem [PDF]

open access: yes, 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

Home - About - Disclaimer - Privacy