↓ Skip to main content

Integer Programming and Combinatorial Optimization

Overview of attention for book
Cover of 'Integer Programming and Combinatorial Optimization'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 On Approximation Algorithms for Concave Mixed-Integer Quadratic Programming
  3. Altmetric Badge
    Chapter 2 Centerpoints: A Link Between Optimization and Convex Geometry
  4. Altmetric Badge
    Chapter 3 Rescaled Coordinate Descent Methods for Linear Programming
  5. Altmetric Badge
    Chapter 4 Approximating Min-Cost Chain-Constrained Spanning Trees: A Reduction from Weighted to Unweighted Problems
  6. Altmetric Badge
    Chapter 5 Max-Cut Under Graph Constraints
  7. Altmetric Badge
    Chapter 6 Sparsest Cut in Planar Graphs, Maximum Concurrent Flows and Their Connections with the Max-Cut Problem
  8. Altmetric Badge
    Chapter 7 Intersection Cuts for Bilevel Optimization
  9. Altmetric Badge
    Chapter 8 Exact Algorithms for the Chance-Constrained Vehicle Routing Problem
  10. Altmetric Badge
    Chapter 9 Extended Formulations in Mixed-integer Convex Programming
  11. Altmetric Badge
    Chapter 10 k-Trails: Recognition, Complexity, and Approximations
  12. Altmetric Badge
    Chapter 11 Better s-t-Tours by Gao Trees
  13. Altmetric Badge
    Chapter 12 Popular Edges and Dominant Matchings
  14. Altmetric Badge
    Chapter 13 Semidefinite and Linear Programming Integrality Gaps for Scheduling Identical Machines
  15. Altmetric Badge
    Chapter 14 Stabilizing Network Bargaining Games by Blocking Players
  16. Altmetric Badge
    Chapter 15 Round-Robin Tournaments Generated by the Circle Method Have Maximum Carry-Over
  17. Altmetric Badge
    Chapter 16 Extreme Functions with an Arbitrary Number of Slopes
  18. Altmetric Badge
    Chapter 17 Minimal Cut-Generating Functions are Nearly Extreme
  19. Altmetric Badge
    Chapter 18 On the Mixed Binary Representability of Ellipsoidal Regions
  20. Altmetric Badge
    Chapter 19 Constant Factor Approximation for ATSP with Two Edge Weights
  21. Altmetric Badge
    Chapter 20 Improved Approximation Algorithms for Hitting 3-Vertex Paths
  22. Altmetric Badge
    Chapter 21 Improved Approximations for Cubic Bipartite and Cubic TSP
  23. Altmetric Badge
    Chapter 22 An Approximation Algorithm for Uniform Capacitated k-Median Problem with $$1+\epsilon $$ Capacity Violation
  24. Altmetric Badge
    Chapter 23 Valid Inequalities for Separable Concave Constraints with Indicator Variables
  25. Altmetric Badge
    Chapter 24 A Polyhedral Approach to Online Bipartite Matching
  26. Altmetric Badge
    Chapter 25 On Some Polytopes Contained in the 0,1 Hypercube that Have a Small Chvátal Rank
  27. Altmetric Badge
    Chapter 26 Robust Monotone Submodular Function Maximization
  28. Altmetric Badge
    Chapter 27 Maximizing Monotone Submodular Functions over the Integer Lattice
  29. Altmetric Badge
    Chapter 28 Submodular Unsplittable Flow on Trees
  30. Altmetric Badge
    Chapter 29 Strong Reductions for Extended Formulations
  31. Altmetric Badge
    Chapter 30 Sum-of-Squares Hierarchy Lower Bounds for Symmetric Formulations
  32. Altmetric Badge
    Chapter 31 Approximation-Friendly Discrepancy Rounding
  33. Altmetric Badge
    Chapter 32 Deciding Emptiness of the Gomory-Chvátal Closure is NP-Complete, Even for a Rational Polyhedron Containing No Integer Point
  34. Altmetric Badge
    Chapter 33 On the Quantile Cut Closure of Chance-Constrained Problems
Attention for Chapter 3: Rescaled Coordinate Descent Methods for Linear Programming
Altmetric Badge

Citations

dimensions_citation
1 Dimensions

Readers on

mendeley
10 Mendeley
You are seeing a free-to-access but limited selection of the activity Altmetric has collected about this research output. Click here to find out more.
Chapter title
Rescaled Coordinate Descent Methods for Linear Programming
Chapter number 3
Book title
Integer Programming and Combinatorial Optimization
Published by
Springer, Cham, June 2016
DOI 10.1007/978-3-319-33461-5_3
Book ISBNs
978-3-31-933460-8, 978-3-31-933461-5
Authors

Daniel Dadush, László A. Végh, Giacomo Zambelli