Results 91 to 100 of about 146 (126)

A 4 3 -approximation for the maximum leaf spanning arborescence problem in DAGs. [PDF]

Math Program
Neuwohner M.
europepmc   +1 more source

Total-Chromatic Number and Chromatic Index of Dually Chordal Graphs

, 2007
A graph is dually chordal if it is the clique graph of a chordal graph. Alternatively, a graph is dually chordal if it admits a maximum neighbourhood order. This class generalizes known subclasses of chordal graphs such as doubly chordal graphs, strongly
Celina M. H. De Figueiredo, C'elia Picinin De Mello, Joao Meidanis, Célia Picinin de Mello   +3 more
core  

Approximate Max-Min Resource Sharing For Structured Concave Optimization

, 1999
. We present a Lagrangian decomposition algorithm which uses logarithmic potential reduction to compute an #-approximate solution of the general max-min resource sharing problem with M nonnegative concave constraints on a convex set B.
J. Villavicencio, M. D. Grigoriadis, L.G. Khachiyan, L. Porkolab   +3 more
core  

A Novel Binary Dream Optimization Algorithm with Data-Driven Repair for the Set Covering Problem. [PDF]

Biomimetics (Basel)
Crawford B, Caballero H, Astorga G, Cisternas-Caneo F, Becerra-Rozas M, Baeza A, Bernales G, Puga P, Giachetti G, Soto R.   +9 more
europepmc   +1 more source

New Binary Reptile Search Algorithms for Binary Optimization Problems. [PDF]

Biomimetics (Basel)
Crawford B, López Cortés B, Cisternas-Caneo F, Gómez-Pulido JM, Olivares R, Soto R, Barrera-Garcia J, Brante-Aguilera C, Giachetti G.   +8 more
europepmc   +1 more source

A linear time algorithm for linearizing quadratic and higher-order shortest path problems. [PDF]

Math Program
Çela E, Klinz B, Lendl S, Woeginger GJ, Wulf L.   +4 more
europepmc   +1 more source

New algorithms for maximum disjoint paths based on tree-likeness. [PDF]

Math Program, 2018
Fleszar K, Mnich M, Spoerhase J.
europepmc   +1 more source

Advances on strictly Δ -modular IPs. [PDF]

Math Program
Nägele M, Nöbel C, Santiago R, Zenklusen R.   +3 more
europepmc   +1 more source

Generating subtour elimination constraints for the TSP from pure integer solutions. [PDF]

Cent Eur J Oper Res, 2017
Pferschy U, Staněk R.
europepmc   +1 more source

Binary Pufferfish Optimization Algorithm for Combinatorial Problems. [PDF]

Biomimetics (Basel)
Crawford B, Paz Á, Soto R, Peña Fritz Á, Astorga G, Cisternas-Caneo F, Toledo Mac-Lean CP, Solís-Piñones F, Arce JL, Giachetti G.   +9 more
europepmc   +1 more source