Results 101 to 110 of about 148 (126)

Lower Bounds For The Quadratic Assignment Problem

, 1994
. We investigate the classical Gilmore-Lawler lower bound for the quadratic assignment problem. We provide evidence of the difficulty of improving the Gilmore-Lawler Bound and develop new bounds by means of optimal reduction schemes.
Y. Li, M.G.C. Resende, P.M. Pardalos, K.G. Ramakrishnan   +3 more
core  

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

Robust network design in telecommunications under polytope demand uncertainty

We consider a model for robust network design in telecommunications, in which we minimize the cost of the maximum mismatch between supply and demand. In the present study, the demand is uncertain and takes its values in a polytope defined by constraints.
Lemaréchal, Claude, Petrou, Georgios, Ouorou, Adam   +2 more
core  

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

Some of the next articles are maybe not open access.

Related searches:

Regular Matroids Have Polynomial Extension Complexity

Mathematics of Operations Research, 2022
Manuel Aprile, Samuel Fiorini
exaly  

Quasi-Polynomial Algorithms for Submodular Tree Orienteering and Directed Network Design Problems

Mathematics of Operations Research, 2022
Viswanath Nagarajan
exaly  

Prophet Matching With General Arrivals

Mathematics of Operations Research, 2022
Michal Feldman, Nikolai Gravin, Zhihao Gavin Tang   +2 more
exaly