Results 261 to 270 of about 1,968,255 (301)
Some of the next articles are maybe not open access.

Metaheuristics in Combinatorial Optimization

Annals of Operations Research, 2005
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Michel Gendreau, Jean-Yves Potvin
exaly   +4 more sources

Convex Combinatorial Optimization [PDF]

open access: yesDiscrete and Computational Geometry, 2004
We introduce the convex combinatorial optimization problem, a far reaching generalization of the standard linear combinatorial optimization problem. We show that it is strongly polynomial time solvable over any edge-guaranteed family, and discuss several applications.
Shmuel Onn, Uriel G Rothblum
exaly   +6 more sources

Quantified Combinatorial Optimization

2014
MIP and IP programming are state-of-the-art modeling techniques for computer-aided optimization. However, companies observe an increasing danger of disruptions that prevent them from acting as planned. One reason is input data being assumed as deterministic, but in reality, data is afflicted with uncertainties.
Thorsten Ederer   +2 more
openaire   +2 more sources

Rollout Algorithms for Combinatorial Optimization

Journal of Heuristics, 1997
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Dimitri P. Bertsekas   +2 more
openaire   +3 more sources

Combinatorial Optimization in OPL Studio

1999
OPL is a modeling language for mathematical programming and combinatorial optimization problems. It is the first modeling language to combine high-level algebraic and set notations from modeling languages with a rich constraint language and the ability to specify search procedures and strategies that are the essence of constraint programming.
Van Hentenryck, P.   +4 more
openaire   +3 more sources

Probabilistic combinatorial optimization

1981
The (bounded) generalized maximum satisfiability problem covers a broad range of NP-complete problems, e.g. it is a generalization of INDEPENDENT SET, LINEAR INEQUALITY, HITTING SET, SET PACKING, MINIMUM COVER, etc. The complexity of finding approximations for problems in this class is analyzed.
openaire   +1 more source

Combinatorial Optimization

Oberwolfach Reports, 2015
Combinatorial Optimization is an area of mathematics that thrives from a continual influx of new questions and problems from practice. Attacking these problems has required the development and combination of ideas and techniques from different mathematical areas including graph theory, matroids and combinatorics, convex and nonlinear optimization ...
Gérard P. Cornuéjols   +2 more
openaire   +1 more source

Combinatorial Optimization

Oberwolfach Reports, 2019
Combinatorial Optimization is an active research area that developed from the rich interaction among many mathematical areas, including combinatorics, graph theory, geometry, optimization, probability, theoretical computer science, and many others. It combines algorithmic and complexity analysis with a mature mathematical foundation and it yields both ...
Jesús De Loera   +2 more
openaire   +1 more source

On Disjunctive Cuts for Combinatorial Optimization

Journal of Combinatorial Optimization, 2001
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

Combinatorial Optimization by Dynamic Contraction

Journal of Heuristics, 1997
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +3 more sources

Home - About - Disclaimer - Privacy