Critical evaluation of branch polarity and apical dominance as dictators of colony astogeny in a branching coral. [PDF]
PLoS 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
Pruning by Isomorphism in Branch-and-Cut
Mathematical Programming, 2001 The paper presents a branch-and-cut for solving (0, 1) integer linear programs having a large symmetry group. The group is used for pruning the enumeration tree and for generating cuts. The cuts are non-standard, cutting integer feasible solutions but leaving the optimal value of the problem unchanged.
openaire +2 more sources
Branch-and-price-and-cut for large-scale multicommodity capacitated fixed-charge network design
EURO Journal on Computational Optimization, 2014 We present a branch-and-price-and-cut algorithm for solving large-scale instances of the multicommodity capacitated fixed-charge network design problem.
Bernard Gendron, Mathieu Larose
doaj +1 more source
Branch-and-Cut-and-Price for Multi-Agent Pathfinding [PDF]
Proceedings 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
Exploring the Numerics of Branch-and-Cut for Mixed Integer Linear Optimization
, 2018 We investigate how the numerical properties of the LP relaxations evolve throughout the solution procedure in a solver employing the branch-and-cut algorithm.
Miltenberger, Matthias +2 more
core +1 more source
A Polynomial time Algorithm for Hamilton Cycle with maximum Degree 3
, 2020 Based on the famous Rotation-Extension technique, by creating the new concepts and methods: broad cycle, main segment, useful cut and insert, destroying edges for a main segment, main goal Hamilton cycle, depth-first search tree, we develop a polynomial ...
Du, Lizhi
core
A modied branch and cut procedure for resource portfolio problem under relaxed resource dedication policy [PDF]
, 2012 Multi-project scheduling problems are characterized by the way resources are managed in the problem environment. The general approach in multi-project scheduling literature is to consider resource capacities as a common pool that can be shared among ...
Besikci, Umut +5 more
core
Path Planning for Cooperative Routing of Air-Ground Vehicles
, 2016 We consider a cooperative vehicle routing problem for surveillance and reconnaissance missions with communication constraints between the vehicles.
Casbeer, David +2 more
core +1 more source
Self-Force and Green Function in Schwarzschild spacetime via Quasinormal Modes and Branch Cut
, 2013 The motion of a small compact object in a curved background spacetime deviates from a geodesic due to the action of its own field, giving rise to a self-force. This self-force may be calculated by integrating the Green function for the wave equation over
Casals, Marc +3 more
core +1 more source
An exact method for a discrete multiobjective linear fractional optimization [PDF]
Integer linear fractional programming problem with multiple objective MOILFP is an important field of research and has not received as much attention as did multiple objective linear fractional programming.
Chergui, M. E-A, Moulai, M.
core +1 more source