Show indexed articles as search result.

The articles of this volume will be reviewed individually. For the preceding conference see [Zbl 1258.90003].
Indexed articles:
Abdi, Ahmad; Guenin, Bertrand, The cycling property for the clutter of odd \(st\)-walks, 1-12 [Zbl 1418.90207]
Adler, Ilan; Papadimitriou, Christos; Rubinstein, Aviad, On simplex pivoting rules and complexity theory, 13-24 [Zbl 1418.90145]
Aissi, Hassene; Mahjoub, A. Ridha; McCormick, S. Thomas; Queyranne, Maurice, A strongly polynomial time algorithm for multicriteria global minimum cuts, 25-36 [Zbl 1418.90209]
Aliev, Iskander; De Loera, Jesús A.; Louveaux, Quentin, Integer programs with prescribed number of solutions and a weighted version of Doignon-Bell-Scarf’s theorem, 37-51 [Zbl 1418.90157]
An, Hyung-Chan; Bhaskara, Aditya; Chekuri, Chandra; Gupta, Shalmoli; Madan, Vivek; Svensson, Ola, Centrality of trees for capacitated \(k\)-center, 52-63 [Zbl 1333.90067]
Angulo, Alejandro; Espinoza, Daniel; Palma, Rodrigo, Sequence independent, simultaneous and multidimensional lifting of generalized flow covers for the semi-continuous knapsack problem with generalized upper bounds constraints, 64-75 [Zbl 1418.90211]
Averkov, Gennadiy; Basu, Amitabh, On the unique-lifting property, 76-87 [Zbl 1418.90170]
Baïou, Mourad; Barahona, Francisco, Maximum weighted induced bipartite subgraphs and acyclic subgraphs of planar cubic graphs, 88-101 [Zbl 1418.90212]
Bansal, Manish; Kianfar, Kiavash, \(N\)-step cycle inequalities: facets for continuous \(n\)-mixing set and strong cuts for multi-module capacitated lot-sizing problem, 102-113 [Zbl 1418.90172]
Bansal, Nikhil; Nagarajan, Viswanath, On the adaptivity gap of stochastic orienteering, 114-125 [Zbl 1415.90046]
Bhalgat, Anand; Khanna, Sanjeev, A utility equivalence theorem for concave functions, 126-137 [Zbl 1410.91224]
Bhaskar, Umang; Ligett, Katrina; Schulman, Leonard J., Network improvement for equilibrium routing, 138-149 [Zbl 1410.91119]
Bock, Adrian; Chandrasekaran, Karthekeyan; Könemann, Jochen; Peis, Britta; Sanità, Laura, Finding small stabilizers for unstable graphs, 150-161 [Zbl 1410.91017]
Boland, Natashia; Charkhgard, Hadi; Savelsbergh, Martin, The triangle splitting method for biobjective mixed integer programming, 162-173 [Zbl 1418.90244]
Bonami, Pierre; Margot, François, Cut generation through binarization, 174-185 [Zbl 1418.90174]
Boyd, Sylvia; Fu, Yao; Sun, Yu, A \(\frac{5}{4}\)-approximation for subcubic 2EC using circulations, 186-197 [Zbl 1418.90215]
Buchheim, Christoph; D’Ambrosio, Claudia, Box-constrained mixed-integer polynomial optimization using separable underestimators, 198-209 [Zbl 1418.90175]
Chakrabarti, Amit; Kale, Sagar, Submodular maximization meets streaming: matchings, matroids, and more, 210-221 [Zbl 1418.90217]
Chekuri, Chandra; Ene, Alina, The all-or-nothing flow problem in directed graphs with symmetric demand pairs, 222-233 [Zbl 1418.90272]
Conforti, Michele; Del Pia, Alberto; Di Summa, Marco; Faenza, Yuri, Reverse split rank, 234-248 [Zbl 1418.90162]
Correa, José R.; Marchetti-Spaccamela, Alberto; Matuschke, Jannik; Stougie, Leen; Svensson, Ola; Verdugo, Víctor; Verschae, José, Strong LP formulations for scheduling splittable jobs on unrelated machines, 249-260 [Zbl 1415.90040]
Dey, Santanu S.; Molinaro, Marco; Wang, Qianyi, How good are sparse cutting-planes?, 261-272 [Zbl 1418.90177]
Feige, Uriel; Ravi, R.; Singh, Mohit, Short tours through large linear forests, 273-284 [Zbl 1418.90274]
Friggstad, Zachary; Könemann, Jochen; Kun-Ko, Young; Louis, Anand; Shadravan, Mohammad; Tulsiani, Madhur, Linear programming hierarchies suffice for directed Steiner tree, 285-296 [Zbl 1418.90223]
Huang, Chien-Chung; Kavitha, Telikepalli, An improved approximation algorithm for the stable marriage problem with one-sided ties, 297-308 [Zbl 1418.90230]
Kaibel, Volker; Walter, Matthias, Simple extensions of polytopes, 309-320 [Zbl 1418.90233]
Kaibel, Volker; Weltge, Stefan, Lower bounds on the sizes of integer programs without additional variables, 321-332 [Zbl 1418.90166]
Kalaitzis, Christos; Mądry, Aleksander; Newman, Alantha; Poláček, Lukáš; Svensson, Ola, On the configuration LP for maximum budgeted allocation, 333-344 [Zbl 1410.91312]
Kılınç-Karzan, Fatma; Yıldız, Sercan, Two-term disjunctions on the second-order cone, 345-356 [Zbl 1418.90178]
Korupolu, Madhukar; Meyerson, Adam; Rajaraman, Rajmohan; Tagiku, Brian, Coupled and \(k\)-sided placements: generalizing generalized assignment, 357-368 [Zbl 1333.90070]
Lau, Lap Chi; Zhou, Hong, A unified algorithm for degree bounded survivable network design, 369-380 [Zbl 1418.90276]
Mnich, Matthias; Wiese, Andreas, Scheduling and fixed-parameter tractability, 381-392 [Zbl 1332.68088]
Pecin, Diego; Pessoa, Artur; Poggi, Marcus; Uchoa, Eduardo, Improved branch-cut-and-price for capacitated vehicle routing, 393-403 [Zbl 1418.90239]
Bruhn, Henning; Schaudt, Oliver, Claw-free \(t\)-perfect graphs can be recognised in polynomial time, 404-415 [Zbl 1418.90270]