Results 51 to 60 of about 167,714 (331)
Phase Transitions and Backbones of the Asymmetric Traveling Salesman Problem
, 2011 In recent years, there has been much interest in phase transitions of combinatorial problems. Phase transitions have been successfully used to analyze combinatorial optimization problems, characterize their typical-case features and locate the hardest ...
Zhang, W.
core +1 more source
Reducing Revenue to Welfare Maximization: Approximation Algorithms and other Generalizations [PDF]
, 2013 It was recently shown in [http://arxiv.org/abs/1207.5518] that revenue optimization can be computationally efficiently reduced to welfare optimization in all multi-dimensional Bayesian auction problems with arbitrary (possibly combinatorial) feasibility ...
Cai, Yang +2 more
core +5 more sources
Combinatorial Continuous Maximal Flows [PDF]
, 2011 Maximum flow (and minimum cut) algorithms have had a strong impact on computer vision. In particular, graph cuts algorithms provide a mechanism for the discrete optimization of an energy functional which has been used in a variety of applications such as
Couprie, Camille +3 more
core +6 more sources
On simple combinatorial optimization problems
Discrete Mathematics, 1992 AbstractWe characterize (0,1) linear programming matrices for which a greedy algorithm and its dual solve certain covering and packing problems. Special cases are shortest path and minimum spanning tree algorithms.
openaire +1 more source
Domination analysis of combinatorial optimization problems
Discrete Applied Mathematics, 2003 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Gregory Z. Gutin +2 more
openaire +1 more source
A General Combinatorial Ant System-based Distributed Routing Algorithm for Communication Networks [PDF]
Journal of Systemics, Cybernetics and Informatics, 2007 In this paper, a general Combinatorial Ant System-based distributed routing algorithm modeled like a dynamic combinatorial optimization problem is presented.
Jose Aguilar, Miguel Labrador
doaj
International Journal of Advanced Robotic Systems, 2017 This article presents a critical evaluation of swarm intelligence techniques for solving combinatorial optimization problems. Since, unarguably, the traveling salesman’s problem is the most developed, studied, and popular combinatorial problem, this ...
Julius Odili +3 more
doaj +1 more source
On the depth of combinatorial optimization problems
Discrete Applied Mathematics, 1993 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Pediatric Blood &Cancer, EarlyView.ABSTRACT Background Survivors of childhood acute lymphoblastic leukemia (ALL) often exhibit early deficits in muscle and movement competence, which can compromise long‐term health. Integrative neuromuscular training (INT), a multifaceted approach combining fundamental movement activities with strength exercises, may help address these deficits during ...
Anna Maria Markarian +7 more
wiley +1 more source
Strongly Polynomial Primal-Dual Algorithms for Concave Cost Combinatorial Optimization Problems [PDF]
, 2012 We introduce an algorithm design technique for a class of combinatorial optimization problems with concave costs. This technique yields a strongly polynomial primal-dual algorithm for a concave cost problem whenever such an algorithm exists for the fixed-
Magnanti, Thomas L., Stratila, Dan
core +2 more sources