Results 71 to 80 of about 737 (80)

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

Characterization of matrices with bounded Graver bases and depth parameters and applications to integer programming. [PDF]

Math Program
Briański M, Koutecký M, Král' D, Pekárková K, Schröder F.   +4 more
europepmc   +1 more source

Better-than- 4 3 -approximations for leaf-to-leaf tree and connectivity augmentation. [PDF]

Math Program
Cecchetto F, Traub V, Zenklusen R.
europepmc   +1 more source

Optimization in electronic markets: examples in combinatorial auctions. [PDF]

Hoesel, Stan van, Muller, Rudolf
core   +1 more source

The selectope for games with partial cooperation. [PDF]

Bilbao, J.M., Jimenez, N., Lebron, E., Peters, H.   +3 more
core   +1 more source