↓ Skip to main content
What is this page? Embed badge

Integer Programming and Combinatorial Optimization : 17th International Conference, IPCO 2014, Bonn, Germany, June 23-25, 2014. Proceedings

Overview of attention for book
Cover of 'Integer Programming and Combinatorial Optimization : 17th International Conference, IPCO 2014, Bonn, Germany, June 23-25, 2014. Proceedings'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 The Cycling Property for the Clutter of Odd st-Walks
  3. Altmetric Badge
    Chapter 2 On Simplex Pivoting Rules and Complexity Theory
  4. Altmetric Badge
    Chapter 3 A Strongly Polynomial Time Algorithm for Multicriteria Global Minimum Cuts
  5. Altmetric Badge
    Chapter 4 Integer Programs with Prescribed Number of Solutions and a Weighted Version of Doignon-Bell-Scarf’s Theorem
  6. Altmetric Badge
    Chapter 5 Centrality of Trees for Capacitated k-Center
  7. Altmetric Badge
    Chapter 6 Sequence Independent, Simultaneous and Multidimensional Lifting of Generalized Flow Covers for the Semi-Continuous Knapsack Problem with Generalized Upper Bounds Constraints
  8. Altmetric Badge
    Chapter 7 On the Unique-Lifting Property
  9. Altmetric Badge
    Chapter 8 Maximum Weighted Induced Bipartite Subgraphs and Acyclic Subgraphs of Planar Cubic Graphs
  10. Altmetric Badge
    Chapter 9 n-Step Cycle Inequalities: Facets for Continuous n-Mixing Set and Strong Cuts for Multi-Module Capacitated Lot-Sizing Problem
  11. Altmetric Badge
    Chapter 10 On the Adaptivity Gap of Stochastic Orienteering
  12. Altmetric Badge
    Chapter 11 A Utility Equivalence Theorem for Concave Functions
  13. Altmetric Badge
    Chapter 12 Network Improvement for Equilibrium Routing
  14. Altmetric Badge
    Chapter 13 Finding Small Stabilizers for Unstable Graphs
  15. Altmetric Badge
    Chapter 14 The Triangle Splitting Method for Biobjective Mixed Integer Programming
  16. Altmetric Badge
    Chapter 15 Cut Generation through Binarization
  17. Altmetric Badge
    Chapter 16 A $\frac{5}{4}$ -Approximation for Subcubic 2EC Using Circulations
  18. Altmetric Badge
    Chapter 17 Box-Constrained Mixed-Integer Polynomial Optimization Using Separable Underestimators
  19. Altmetric Badge
    Chapter 18 Submodular Maximization Meets Streaming: Matchings, Matroids, and More
  20. Altmetric Badge
    Chapter 19 The All-or-Nothing Flow Problem in Directed Graphs with Symmetric Demand Pairs
  21. Altmetric Badge
    Chapter 20 Reverse Split Rank
  22. Altmetric Badge
    Chapter 21 Strong LP Formulations for Scheduling Splittable Jobs on Unrelated Machines
  23. Altmetric Badge
    Chapter 22 How Good Are Sparse Cutting-Planes?
  24. Altmetric Badge
    Chapter 23 Short Tours through Large Linear Forests
  25. Altmetric Badge
    Chapter 24 Linear Programming Hierarchies Suffice for Directed Steiner Tree
  26. Altmetric Badge
    Chapter 25 An Improved Approximation Algorithm for the Stable Marriage Problem with One-Sided Ties
  27. Altmetric Badge
    Chapter 26 Simple Extensions of Polytopes
  28. Altmetric Badge
    Chapter 27 Lower Bounds on the Sizes of Integer Programs without Additional Variables
  29. Altmetric Badge
    Chapter 28 On the Configuration LP for Maximum Budgeted Allocation
  30. Altmetric Badge
    Chapter 29 Two-Term Disjunctions on the Second-Order Cone
  31. Altmetric Badge
    Chapter 30 Coupled and k-Sided Placements: Generalizing Generalized Assignment
  32. Altmetric Badge
    Chapter 31 A Unified Algorithm for Degree Bounded Survivable Network Design
  33. Altmetric Badge
    Chapter 32 Scheduling and Fixed-Parameter Tractability
  34. Altmetric Badge
    Chapter 33 Improved Branch-Cut-and-Price for Capacitated Vehicle Routing
  35. Altmetric Badge
    Chapter 34 Claw-Free t-Perfect Graphs Can Be Recognised in Polynomial Time
Attention for Chapter 15: Cut Generation through Binarization
Altmetric Badge

Readers on

mendeley
6 Mendeley
Summary
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
Cut Generation through Binarization
Chapter number 15
Book title
Integer Programming and Combinatorial Optimization
Published in
Lecture notes in computer science, January 2014
DOI 10.1007/978-3-319-07557-0_15
Book ISBNs
978-3-31-907556-3, 978-3-31-907557-0
Authors

Bonami, Pierre, Margot, François, Pierre Bonami, François Margot

View on publisher site
Mendeley readers

Mendeley readers

The data shown below were compiled from readership statistics for 6 Mendeley readers of this research output. Click here to see the associated Mendeley record.

Geographical breakdown

Country Count As %
Unknown 6 100%

Demographic breakdown

Readers by professional status Count As %
Researcher 5 83%
Student > Ph. D. Student 1 17%
Readers by discipline Count As %
Mathematics 4 67%
Computer Science 1 17%
Unknown 1 17%

This page is provided by Altmetric.