Results 11 to 20 of about 39 (39)
Shortest paths on polymatroids and hypergraphic polytopes [PDF]
Base polytopes of polymatroids, also known as generalized permutohedra, are polytopes whose edges are parallel to a vector of the form \(\mathbf{e}_i - \mathbf{e}_j\), where the \(\{\mathbf{e}_i\}_{i\in [n]}\) are the canonical basis vectors of \(\mathbb{
Cardinal, Jean, Steiner, Raphael
core +1 more source
Mathematical Optimization for the Train Timetabling Problem [PDF]
, 2010 AMS Subj. Classification: 90C57; 90C10;Rail transportation is very rich in terms of problems that can be modelled and solved using mathematical optimization techniques. The train scheduling problem as the most important part of a rail operating policy has
Marić, Miroslav +4 more
core
Planeación de sistemas secundarios de distribución usando el algoritmo Branch and Bound
Ingeniería y Ciencia, 2011 En este trabajo se plantea una metodología para la solución del problema delplaneamiento de sistemas secundarios de distribución considerando un modelode programación lineal entero mixto (PLEM), el cual considera la ubicación y dimensionamiento de ...
Carlos Javier Tapias-Isaza +2 more
doaj
Applying mod-k-cuts for solving linear ordering problems
Linear ordering problem, Branch-and-cut, Mod-k cuts, 90C27, 90C57,
M. Oswald, H. Seitz, G. Reinelt
core +1 more source
$${{\mathcal {D}(\mathcal {C})}}$$ -optimization and robust global optimization
Nonconvex global optimization, Approximate optimal solution, Robust approach, Essential optimal solution, dc optimization, dm (monotonic) optimization, $${{\mathcal {D}(\mathcal {C})}}$$ -optimization, Successive Incumbent Transcending Algorithm, 90C26 ...
Hoang Tuy
core +1 more source
Complexity of linear relaxations in integer programming. [PDF]
Math Program, 2022 Averkov G, Schymura M.
europepmc +1 more source
Idealness of k-wise intersecting families. [PDF]
Math Program, 2022 Abdi A, Cornuéjols G, Huynh T, Lee D.
europepmc +1 more source
A nearly optimal randomized algorithm for explorable heap selection. [PDF]
Math ProgramBorst S +3 more
europepmc +1 more source
On SOCP-based disjunctive cuts for solving a class of integer bilevel nonlinear programs. [PDF]
Math ProgramGaar E +4 more
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Quasi-Popular Matchings, Optimality, and Extended Formulations
Mathematics of Operations Research, 2022Yuri Faenza, Telikepalli Kavitha
exaly