Die bibliographische Datenbank LEABib

Suchen • Liste der Journale • Liste der Serien • Liste der Konferenzen • Ausgewählte Publikationen	Hilfe

Suche: Series=LNCS AND Volume=4513

Als [bib] [pdf] [ps] [dvi] [xml] herunterladen.

Inequalities from two rows of a simplex tableau
Kent Andersen, Quentin Louveaux, Robert Weismantel, Laurence A. Wolsey
Lecture Notes in Computer Science 4513, 2007, pp. 1-15
Cuts for conic mixed-integer programming
Alper Atamtürk, Vishnu Narayanan
Lecture Notes in Computer Science 4513, 2007, pp. 16-29
Sequential-merge facets for two-dimensional group problems
Santanu S. Dey, Jean-Philippe P. Richard
Lecture Notes in Computer Science 4513, 2007, pp. 30-42
Triangle-free simple 2-matchings in subcubic graphs
David Hartvigsen, Yanjun Li
Lecture Notes in Computer Science 4513, 2007, pp. 43-52
The smoothed number of Pareto optimal solutions in bicriteria integer optimization
Rene Beier, Heiko Röglin, Berthold Vöcking
Lecture Notes in Computer Science 4513, 2007, pp. 53-67
Finding a polytope from its graph in polynomial time
Eric J. Friedman
Lecture Notes in Computer Science 4513, 2007, pp. 68-73
Orbitopal fixing
Volker Kaibel, Matthias Peinhardt, Marc E. Pfetsch
Lecture Notes in Computer Science 4513, 2007, pp. 74-88
New variants of lift-and-project cut generation from the LP tableau: Open source implementation and testing
Egon Balas, Pierre Bonami
Lecture Notes in Computer Science 4513, 2007, pp. 89-103
Orbital branching
James Ostrowski, Jeff Linderoth, Fabrizio Rossi, Stefano Smriglio
Lecture Notes in Computer Science 4513, 2007, pp. 104-118
Distinct triangle areas in a planar point set
Adrian Dumitrescu, Csaba D. Tóth
Lecture Notes in Computer Science 4513, 2007, pp. 119-129
Scheduling with precedence constraints of low fractional dimension
Christoph Ambühl, Monaldo Mastrolilli, Nikolaus Mutsanas, Ola Svensson
Lecture Notes in Computer Science 4513, 2007, pp. 130-144
Approximation algorithms for 2-stage stochastic scheduling problems
David B. Shmoys, Mauro Sozio
Lecture Notes in Computer Science 4513, 2007, pp. 145-157
On integer programming and the branch-width of the constraint matrix
William H. Cunningham, Jim Geelen
Lecture Notes in Computer Science 4513, 2007, pp. 158-166
Matching problems in polymatroids without double circuits
Márton Makai, Gyula Pap, Jácint Szabó
Lecture Notes in Computer Science 4513, 2007, pp. 167-181
Maximizing a submodular set function subject to a matroid constraint
Gruia Calinescu, Chandra Chekuri, Martin Pál, Jan Vondrák
Lecture Notes in Computer Science 4513, 2007, pp. 182-196
On a generalization of the Master Cyclic Group Polyhedron
Sanjeeb Dash, Ricardo Fukasawa, Oktay Günlük
Lecture Notes in Computer Science 4513, 2007, pp. 197-209
A framework to derive multidimensional superadditive lifting functions and its applications
Bo Zeng, Jean-Philippe P. Richard
Lecture Notes in Computer Science 4513, 2007, pp. 210-224
On the exact separation of mixed integer knapsack cuts
Ricardo Fukasawa, Marcos Goycoolea
Lecture Notes in Computer Science 4513, 2007, pp. 225-239
A faster strongly polynomial time algorithm for submodular function minimization
James B. Orlin
Lecture Notes in Computer Science 4513, 2007, pp. 240-251
On convex minimization over base polytopes
Kiyohito Nagano
Lecture Notes in Computer Science 4513, 2007, pp. 252-266
Computational geometric approach to submodular function minimization for multiclass queueing systems
Toshinari Itoko, Satoru Iwata
Lecture Notes in Computer Science 4513, 2007, pp. 267-279
Generating multiple solutions for mixed integer programming problems
Emilie Danna, Mary Fenelon, Zonghao Gu, Roland Wunderling
Lecture Notes in Computer Science 4513, 2007, pp. 280-294
A branch and bound algorithm for max-cut based on combining semidefinite and polyhedral relaxations
Franz Rendl, Giovanni Rinaldi, Angelika Wiegele
Lecture Notes in Computer Science 4513, 2007, pp. 295-309
DINS, a MIP improvement heuristic
Shubhashis Ghosh
Lecture Notes in Computer Science 4513, 2007, pp. 310-323
Mixed-integer vertex covers on bipartite graphs
Michele Conforti, Bert Gerards, Giacomo Zambelli
Lecture Notes in Computer Science 4513, 2007, pp. 324-336

Seiten 1 2 >