Results 101 to 110 of about 146 (126)
This paper deals with several bicriteria open-shop scheduling problems where jobs are pre-emptable and their corresponding time-windows must be strictly respected. The criteria are a performance cost and the makespan.
González-Martín, C. +2 more
core
Solving Euclidean Distance Matrix Completion Problems Via Semidefinite Programming
, 1997 . Given a partial symmetric matrix A with only certain elements specified, the Euclidean distance matrix completion problem (EDMCP) is to find the unspecified elements of A that make A a Euclidean distance matrix (EDM).
Abdo Y. Alfakih, Henry Wolkowicz
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
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
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
Some of the next articles are maybe not open access.
Related searches:
Related searches:
QUBO formulations of three NP problems
Journal of Information and Optimization Sciences, 2021Anuradha Mahasinghe
exaly
Regular Matroids Have Polynomial Extension Complexity
Mathematics of Operations Research, 2022Manuel Aprile, Samuel Fiorini
exaly