Die bibliographische Datenbank LEABib

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

Suche: Series=LNCS AND Volume=4513

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

On the MIR closure of polyhedra
Sanjeeb Dash, Oktay Günlük, Andrea Lodi
Lecture Notes in Computer Science 4513, 2007, pp. 337-351
The intersection of continuous mixing polyhedra and the continuous mixing polyhedron with flows
Michele Conforti, Marco Di Summa, Laurence A. Wolsey
Lecture Notes in Computer Science 4513, 2007, pp. 352-366
Simple explicit formula for counting lattice points of polyhedra
Jean B. Lasserre, Eduardo S. Zeron
Lecture Notes in Computer Science 4513, 2007, pp. 367-381
Characterizations of total dual integrality
Edwin O'Shea, András Sebŏ
Lecture Notes in Computer Science 4513, 2007, pp. 382-396
Sign-solvable linear complementarity problems
Naonori Kakimura
Lecture Notes in Computer Science 4513, 2007, pp. 397-409
An integer programming approach for linear programs with probabilistic constraints
James Luedtke, Shabbir Ahmed, George Nemhauser
Lecture Notes in Computer Science 4513, 2007, pp. 410-423
Infrastructure leasing problems
Barbara M. Anthony, Anupam Gupta
Lecture Notes in Computer Science 4513, 2007, pp. 424-438
Robust combinatorial optimization with exponential scenarios
Uriel Feige, Kamal Jain, Mohammad Mahdian, Vahab Mirrokni
Lecture Notes in Computer Science 4513, 2007, pp. 439-453
Approximation algorithms for the multi-item capacitated lot-sizing problem via flow-cover inequalities
Retsef Levi, Andrea Lodi, Maxim Sviridenko
Lecture Notes in Computer Science 4513, 2007, pp. 454-468
Optimal efficiency guarantees for network design mechanisms
Tim Roughgarden, Mukund Sundararajan
Lecture Notes in Computer Science 4513, 2007, pp. 469-483
The set connector problem in graphs
Takuro Fukunaga, Hiroshi Nagamochi
Lecture Notes in Computer Science 4513, 2007, pp. 484-498

Seiten < 1 2