×

Integer programming and combinatoral optimization. 15th international conference, IPCO 2011, New York, NY, USA, June 15–17, 2011. Proceedings. (English) Zbl 1216.90002

Lecture Notes in Computer Science 6655. Berlin: Springer (ISBN 978-3-642-20806-5/pbk). xiii, 432 p. (2011).

Show indexed articles as search result.

The articles of this volume will be reviewed individually. For the preceding conference see Zbl 1189.90006.
Indexed articles:
Ageev, Alexander; Benchetrit, Yohann; Sebő, András; Szigeti, Zoltán, An excluded minor characterization of Seymour graphs, 1-13 [Zbl 1298.05295]
Au, Yu Hin; Tunçel, Levent, Complexity analyses of Bienstock-Zuckerberg and lasserre relaxations on the matching and stable set polytopes, 14-26 [Zbl 1298.90054]
Basu, Amitabh; Cornuéjols, Gérard; Molinaro, Marco, A probabilistic analysis of the strength of the split and triangle closures, 27-38 [Zbl 1298.90055]
Bergner, Martin; Caprara, Alberto; Furini, Fabio; Lübbecke, Marco E.; Malaguti, Enrico; Traversi, Emiliano, Partial convexification of general mips by Dantzig-Wolfe reformulation, 39-51 [Zbl 1339.90242]
Bonami, Pierre, Lift-and-project cuts for mixed integer convex programs, 52-64 [Zbl 1339.90243]
Boyd, Sylvia; Sitters, René; van der Ster, Suzanne; Stougie, Leen, TSP on cubic and subcubic graphs, 65-77 [Zbl 1339.90274]
Chakrabarty, Deeparnab; Chekuri, Chandra; Khanna, Sanjeev; Korula, Nitish, Approximability of capacitated network design, 78-91 [Zbl 1339.90321]
Chakrabarty, Deeparnab; Swamy, Chaitanya, Facility location with client latencies: linear programming based techniques for minimum latency problems, 92-103 [Zbl 1339.90193]
Cook, William; Koch, Thorsten; Steffy, Daniel E.; Wolter, Kati, An exact rational mixed-integer programming solver, 104-116 [Zbl 1339.90244]
D’Ambrosio, Claudia; Linderoth, Jeff; Luedtke, James, Valid inequalities for the pooling problem with binary variables, 117-129 [Zbl 1339.90238]
Dadush, Daniel; Dey, Santanu S.; Vielma, Juan Pablo, On the Chvátal-Gomory closure of a compact convex set, 130-142 [Zbl 1339.52006]
Dey, Santanu S.; Pokutta, Sebastian, Design and verify: A new scheme for generating cutting-planes, 143-155 [Zbl 1339.90239]
Dhesi, Aman; Gupta, Pranav; Kumar, Amit; Parija, Gyana R.; Roy, Sambuddha, Contact center scheduling with strict resource requirements, 156-169 [Zbl 1341.90042]
Eisenbrand, Friedrich; Kakimura, Naonori; Rothvoß, Thomas; Sanità, Laura, Set covering with ordered replacement: additive and multiplicative gaps, 170-182 [Zbl 1341.90108]
Fischetti, Matteo; Monaci, Michele, Backdoor branching, 183-191 [Zbl 1341.90091]
Friedmann, Oliver, A subexponential lower bound for Zadeh’s pivoting rule for solving linear programs and games, 192-206 [Zbl 1341.90143]
Ghaddar, Bissan; Vera, Juan C.; Anjos, Miguel F., An iterative scheme for valid polynomial inequality generation in binary polynomial programming, 207-222 [Zbl 1341.90097]
Giandomenico, Monia; Letchford, Adam N.; Rossi, Fabrizio; Smriglio, Stefano, A new approach to the stable set problem based on ellipsoids, 223-234 [Zbl 1341.90098]
Gørtz, Inge Li; Molinaro, Marco; Nagarajan, Viswanath; Ravi, R., Capacitated vehicle routing with non-uniform speeds, 235-247 [Zbl 1341.90016]
Grandoni, Fabrizio; Rothvoß, Thomas, Approximation algorithms for single and multi-commodity connected facility location, 248-260 [Zbl 1341.90081]
Held, Stephan; Cook, William; Sewell, Edward C., Safe lower bounds for graph coloring, 261-273 [Zbl 1341.05074]
Iwata, Satoru; Takamatsu, Mizuyo, Computing the maximum degree of minors in mixed polynomial matrices via combinatorial relaxation, 274-286 [Zbl 1343.65040]
Kaibel, Volker; Pashkovich, Kanstantsin, Constructing extended formulations from reflection relations, 287-300 [Zbl 1341.90148]
Karlin, Anna R.; Mathieu, Claire; Nguyen, C. Thach, Integrality gaps of linear and semi-definite programming relaxations for knapsack, 301-314 [Zbl 1341.90112]
Király, Tamás; Lau, Lap Chi, Degree bounded forest covering, 315-323 [Zbl 1341.05210]
McCormick, S. Thomas; Peis, Britta, A primal-dual algorithm for weighted abstract cut packing, 324-335 [Zbl 1341.90115]
Nguyen, Trang T.; Tawarmalani, Mohit; Richard, Jean-Philippe P., Convexification techniques for linear complementarity constraints, 336-348 [Zbl 1341.90130]
Parekh, Ojas, Iterative packing for demand and hypergraph matching, 349-361 [Zbl 1341.90116]
Peis, Britta; Wiese, Andreas, Universal packet routing with arbitrary bandwidths and transit times, 362-375 [Zbl 1341.68007]
Ruthmair, Mario; Raidl, Günther R., A layered graph model and an adaptive layers framework to solve delay-constrained minimum tree problems, 376-388 [Zbl 1341.68008]
Soto, José A.; Telha, Claudio, Jump number of two-directional orthogonal ray graphs, 389-403 [Zbl 1341.05219]
Takazawa, Kenjiro, Optimal matching forests and valuated delta-matroids, 404-416 [Zbl 1341.90119]
Van Vyve, Mathieu, Fixed-charge transportation on a path: linear programming formulations, 417-429 [Zbl 1341.90019]

MSC:

90-06 Proceedings, conferences, collections, etc. pertaining to operations research and mathematical programming
90C10 Integer programming
90C27 Combinatorial optimization
00B25 Proceedings of conferences of miscellaneous specific interest

Citations:

Zbl 1189.90006
PDFBibTeX XMLCite
Full Text: DOI