Results 101 to 110 of about 143 (125)
Binary Pufferfish Optimization Algorithm for Combinatorial Problems. [PDF]
Biomimetics (Basel)Crawford B +9 more
europepmc +1 more source
Computing The Combinatorial Canonical Form Of A Layered Mixed Matrix
, 1987 . This paper presents an improved algorithm for computing the Combinatorial Canonical Form (CCF) of a layered mixed matrix A = ` Q T ' , which consists of a numerical matrix Q and a generic matrix T .
Kazuo Murota, Mark Scharbrodt
core
Characterization of matrices with bounded Graver bases and depth parameters and applications to integer programming. [PDF]
Math ProgramBriański M +4 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 +2 more
core
Better-than- 4 3 -approximations for leaf-to-leaf tree and connectivity augmentation. [PDF]
Math ProgramCecchetto F, Traub V, Zenklusen R.
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Regular Matroids Have Polynomial Extension Complexity
Mathematics of Operations Research, 2022Manuel Aprile, Samuel Fiorini
exaly
A Randomly Weighted Minimum Arborescence with a Random Cost Constraint
Mathematics of Operations Research, 2022Alan Frieze
exaly
Adaptive Bin Packing with Overflow
Mathematics of Operations Research, 2022Sebastian Pérez-Salazar +2 more
exaly
Prophet Matching with General Arrivals
Mathematics of Operations Research, 2022Nick Gravin, Zhihao Gavin Tang
exaly