Die bibliographische Datenbank LEABib

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

Suche: Series=LNCS AND Volume=6080

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

Solving LP relaxations of large-scale precedence constrained problems
Daniel Bienstock, Mark Zuckerberg
Lecture Notes in Computer Science 6080, 2010, pp. 1-14
Computing minimum multiway cuts in hypergraphs from hypertree packings
Takuro Fukunaga
Lecture Notes in Computer Science 6080, 2010, pp. 15-28
Eigenvalue techniques for convex objective, nonconvex optimization problems
Daniel Bienstock
Lecture Notes in Computer Science 6080, 2010, pp. 29-42
Restricted b-matchings in degree-bounded graphs
Kristóf Bérczi, László A. Végh
Lecture Notes in Computer Science 6080, 2010, pp. 43-56
Zero-coefficient cuts
Kent Andersen, Robert Weismantel
Lecture Notes in Computer Science 6080, 2010, pp. 57-70
Prize-collecting Steiner network problems
MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz, Zeev Nutov
Lecture Notes in Computer Science 6080, 2010, pp. 71-84
On lifting integer variables in minimal inequalities
Amitabh Basu, Manoel Campelo, Michele Conforti, Gérard Cornuéjols, Giacomo Zambelli
Lecture Notes in Computer Science 6080, 2010, pp. 85-95
Efficient edge splitting-off algorithms maintaining all-pairs edge-connectivities
Lap Chi Lau, Chun Kong Yung
Lecture Notes in Computer Science 6080, 2010, pp. 96-109
On generalizations of network design problems with degree bounds
Nikhil Bansal, Rohit Khandekar, Jochen Könemann, Viswanath Nagarajan, Britta Peis
Lecture Notes in Computer Science 6080, 2010, pp. 110-123
A polyhedral study of the mixed integer cut
Steve Tyber, Ellis L. Johnson
Lecture Notes in Computer Science 6080, 2010, pp. 124-134
Symmetry matters for the sizes of extended formulations
Volker Kaibel, Kanstantsin Pashkovich, Dirk Oliver Theis
Lecture Notes in Computer Science 6080, 2010, pp. 135-148
A 3-approximation for facility location with uniform capacities
Ankit Aggarwal, L. Anand, Manisha Bansal, Naveen Garg, Neelima Gupta, Shubham Gupta, Surabhi Jain
Lecture Notes in Computer Science 6080, 2010, pp. 149-162
Secretary problems via linear programming
Niv Buchbinder, Kamal Jain, Mohit Singh
Lecture Notes in Computer Science 6080, 2010, pp. 163-176
Branched polyhedral systems
Volker Kaibel, Andreas Loos
Lecture Notes in Computer Science 6080, 2010, pp. 177-190
Hitting diamonds and growing cacti
Samuel Fiorini, Gwenaël Joret, Ugo Pietropaoli
Lecture Notes in Computer Science 6080, 2010, pp. 191-204
Approximability of 3- and 4-hop bounded disjoint paths problems
Andreas Bley, Jose Neto
Lecture Notes in Computer Science 6080, 2010, pp. 205-218
A polynomial-time algorithm for optimizing over N-fold 4-block decomposable integer programs
Raymond Hemmecke, Matthias Köppe, Robert Weismantel
Lecture Notes in Computer Science 6080, 2010, pp. 219-229
Universal sequencing on a single machine
Leah Epstein, Asaf Levin, Alberto Marchetti-Spaccamela, Nicole Megow, Julián Mestre, Martin Skutella, Leen Stougie
Lecture Notes in Computer Science 6080, 2010, pp. 230-243
Fault-tolerant facility location: A randomized dependent LP-rounding algorithm
Jaroslaw Byrka, Aravind Srinivasan, Chaitanya Swamy
Lecture Notes in Computer Science 6080, 2010, pp. 244-257
Integer quadratic quasi-polyhedra
Adam N. Letchford
Lecture Notes in Computer Science 6080, 2010, pp. 258-270
An integer programming and decomposition approach to general chance-constrained mathematical programs
James Luedtke
Lecture Notes in Computer Science 6080, 2010, pp. 271-284
An effective branch-and-bound algorithm for convex quadratic integer programming
Christoph Buchheim, Alberto Caprara, Andrea Lodi
Lecture Notes in Computer Science 6080, 2010, pp. 285-298
Extending SDP integrality gaps to Sherali-Adams with applications to Quadratic Programming and MaxCutGain
Siavosh Benabbas, Avner Magen
Lecture Notes in Computer Science 6080, 2010, pp. 299-312
The price of collusion in series-parallel networks
Umang Bhaskar, Lisa Fleischer, Chien-Chung Huang
Lecture Notes in Computer Science 6080, 2010, pp. 313-326
The Chvátal-Gomory closure of an ellipsoid is a polyhedron
Santanu S. Dey, Juan Pablo Vielma
Lecture Notes in Computer Science 6080, 2010, pp. 327-340

Seiten 1 2 >