Search from the table of contents of 2.5 million books
Advanced Search (Beta)
Home > Integer Programming and Combinatorial Optimization: 18th International Conference, IPCO 2016, Liège, Belgium, June 1-3, 2016, Proceedings > Round-Robin Tournaments Generated by the Circle Method Have Maximum Carry-Over
Integer Programming and Combinatorial Optimization: 18th International Conference, IPCO 2016, Liège, Belgium, June 1-3, 2016, Proceedings |
Quentin Louveaux; Martin Skutella
Springer International Publishing
Integer Programming and Combinatorial Optimization: 18th International Conference, IPCO 2016, Liège, Belgium, June 1-3, 2016, Proceedings
Round-Robin Tournaments Generated by the Circle Method Have Maximum Carry-Over
Authors

Erik Lambrechts; Annette M. C. Ficker; Dries R. Goossens; Frits C. R. Spieksma

ARI Id

1664712860874_2867914

Access

Not Available Free

Pages

178-189

DOI

10.1007/978-3-319-33461-5_15

Chapter URL

https://rd.springer.com/chapter/10.1007/978-3-319-33461-5_15

Table of Contents of Book
Showing 1 to 20 of 35 entries
Chapters/HeadingsAuthor(s)PagesInfo
Front Matter
I-XIII
On Approximation Algorithms for Concave Mixed-Integer Quadratic Programming
Alberto Del Pia
1-13
Centerpoints: A Link Between Optimization and Convex Geometry
Amitabh Basu; Timm Oertel
14-25
Rescaled Coordinate Descent Methods for Linear Programming
Daniel Dadush; László A. Végh; Giacomo Zambelli
26-37
Approximating Min-Cost Chain-Constrained Spanning Trees: A Reduction from Weighted to Unweighted Problems
André Linhares; Chaitanya Swamy
38-49
Max-Cut Under Graph Constraints
Jon Lee; Viswanath Nagarajan; Xiangkun Shen
50-62
Sparsest Cut in Planar Graphs, Maximum Concurrent Flows and Their Connections with the Max-Cut Problem
Mourad Baïou; Francisco Barahona
63-76
Intersection Cuts for Bilevel Optimization
Matteo Fischetti; Ivana Ljubić; Michele Monaci; Markus Sinnl
77-88
Exact Algorithms for the Chance-Constrained Vehicle Routing Problem
Thai Dinh; Ricardo Fukasawa; James Luedtke
89-101
Extended Formulations in Mixed-Integer Convex Programming
Miles Lubin; Emre Yamangil; Russell Bent; Juan Pablo Vielma
102-113
k-Trails: Recognition, Complexity, and Approximations
Mohit Singh; Rico Zenklusen
114-125
Better s-t-Tours by Gao Trees
Corinna Gottschalk; Jens Vygen
126-137
Popular Edges and Dominant Matchings
Ágnes Cseh; Telikepalli Kavitha
138-151
Semidefinite and Linear Programming Integrality Gaps for Scheduling Identical Machines
Adam Kurpisz; Monaldo Mastrolilli; Claire Mathieu; Tobias Mömke; Victor Verdugo; Andreas Wiese
152-163
Stabilizing Network Bargaining Games by Blocking Players
Sara Ahmadian; Hamideh Hosseinzadeh; Laura Sanità
164-177
Round-Robin Tournaments Generated by the Circle Method Have Maximum Carry-Over
Erik Lambrechts; Annette M. C. Ficker; Dries R. Goossens; Frits C. R. Spieksma
178-189
Extreme Functions with an Arbitrary Number of Slopes
Amitabh Basu; Michele Conforti; Marco Di Summa; Joseph Paat
190-201
Minimal Cut-Generating Functions are Nearly Extreme
Amitabh Basu; Robert Hildebrand; Marco Molinaro
202-213
On the Mixed Binary Representability of Ellipsoidal Regions
Alberto Del Pia; Jeffrey Poskin
214-225
Constant Factor Approximation for ATSP with Two Edge Weights
Ola Svensson; Jakub Tarnawski; László A. Végh
226-237
Chapters/HeadingsAuthor(s)PagesInfo
Showing 1 to 20 of 35 entries
Similar Books
Similar Chapters
Similar Thesis

Similar News

Similar Articles
Similar Article Headings