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

Combinatorial Optimization

Overview of attention for book
Cover of 'Combinatorial Optimization'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Structure Theorems for Optimum Hyperpaths in Directed Hypergraphs
  3. Altmetric Badge
    Chapter 2 Branch-and-Price Guided Search
  4. Altmetric Badge
    Chapter 3 The New Faces of Combinatorial Optimization
  5. Altmetric Badge
    Chapter 4 Models and Algorithms for the Train Unit Assignment Problem
  6. Altmetric Badge
    Chapter 5 The Minimum Stabbing Triangulation Problem: IP Models and Computational Evaluation
  7. Altmetric Badge
    Chapter 6 Orbital Shrinking
  8. Altmetric Badge
    Chapter 7 Using Symmetry to Optimize Over the Sherali-Adams Relaxation
  9. Altmetric Badge
    Chapter 8 A Second-Order Cone Programming Approximation to Joint Chance-Constrained Linear Programs
  10. Altmetric Badge
    Chapter 9 Semidefinite Relaxations for Mixed 0-1 Second-Order Cone Program
  11. Altmetric Badge
    Chapter 10 The Non-Disjoint m -Ring-Star Problem: Polyhedral Results and SDH/SONET Network Design
  12. Altmetric Badge
    Chapter 11 The Uncapacitated Asymmetric Traveling Salesman Problem with Multiple Stacks
  13. Altmetric Badge
    Chapter 12 Polyhedral Analysis and Branch-and-Cut for the Structural Analysis Problem
  14. Altmetric Badge
    Chapter 13 Extended Formulations, Nonnegative Factorizations, and Randomized Communication Protocols
  15. Altmetric Badge
    Chapter 14 An Algebraic Approach to Symmetric Extended Formulations
  16. Altmetric Badge
    Chapter 15 Dual Consistent Systems of Linear Inequalities and Cardinality Constrained Polytopes
  17. Altmetric Badge
    Chapter 16 Minimum Ratio Cover of Matrix Columns by Extreme Rays of Its Induced Cone
  18. Altmetric Badge
    Chapter 17 Gap Inequalities for the Max-Cut Problem: A Cutting-Plane Algorithm
  19. Altmetric Badge
    Chapter 18 Fast Separation Algorithms for Three-Index Assignment Problems
  20. Altmetric Badge
    Chapter 19 On the Hop Constrained Steiner Tree Problem with Multiple Root Nodes
  21. Altmetric Badge
    Chapter 20 Theoretical Investigation of Aggregation in Pseudo-polynomial Network-Flow Models
  22. Altmetric Badge
    Chapter 21 On Solving the Rooted Delay- and Delay-Variation-Constrained Steiner Tree Problem
  23. Altmetric Badge
    Chapter 22 A Parallel Lagrangian Relaxation Algorithm for the Min-Degree Constrained Minimum Spanning Tree Problem
  24. Altmetric Badge
    Chapter 23 Layered Formulation for the Robust Vehicle Routing Problem with Time Windows
  25. Altmetric Badge
    Chapter 24 Models and Algorithms for Robust Network Design with Several Traffic Scenarios
  26. Altmetric Badge
    Chapter 25 Aircraft Sequencing Problems via a Rolling Horizon Algorithm
  27. Altmetric Badge
    Chapter 26 On the Solution of a Graph Partitioning Problem under Capacity Constraints
  28. Altmetric Badge
    Chapter 27 Sum-Max Graph Partitioning Problem
  29. Altmetric Badge
    Chapter 28 The Packing Coloring Problem for (q,q-4) Graphs
  30. Altmetric Badge
    Chapter 29 Combinatorial Optimization
  31. Altmetric Badge
    Chapter 30 Graph Orientations Optimizing the Number of Light or Heavy Vertices
  32. Altmetric Badge
    Chapter 31 Constrained Matching Problems in Bipartite Graphs
  33. Altmetric Badge
    Chapter 32 The Gram Dimension of a Graph
  34. Altmetric Badge
    Chapter 33 Exploiting a Hypergraph Model for Finding Golomb Rulers
  35. Altmetric Badge
    Chapter 34 Counting Homomorphisms via Hypergraph-Based Structural Restrictions
  36. Altmetric Badge
    Chapter 35 Hardness Results for the Probabilistic Traveling Salesman Problem with Deadlines
  37. Altmetric Badge
    Chapter 36 Differential Approximation of the Multiple Stacks TSP
  38. Altmetric Badge
    Chapter 37 Completion Time Scheduling and the WSRPT Algorithm
  39. Altmetric Badge
    Chapter 38 Two-Agent Scheduling on an Unbounded Serial Batching Machine
  40. Altmetric Badge
    Chapter 39 Second-Price Ad Auctions with Binary Bids and Markets with Good Competition
  41. Altmetric Badge
    Chapter 40 Towards Minimizing k -Submodular Functions
  42. Altmetric Badge
    Chapter 41 Recognition Algorithms for Binary Signed-Graphic Matroids
Overall attention for this book and its chapters
Altmetric Badge

Mentioned by

twitter
2 X users

Citations

dimensions_citation
10 Dimensions

Readers on

mendeley
7 Mendeley
Summary X Dimensions citations
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.
Title
Combinatorial Optimization
Published by
Springer Berlin Heidelberg, July 2012
DOI 10.1007/978-3-642-32147-4
ISBNs
978-3-64-232146-7, 978-3-64-232147-4
Editors

Mahjoub, A. Ridha, Markakis, Vangelis, Milis, Ioannis, Paschos, Vangelis Th.

View on publisher site
X Demographics

X Demographics

The data shown below were collected from the profiles of 2 X users who shared this research output. Click here to find out more about how the information was compiled.
 Mendeley readers

Mendeley readers

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

Geographical breakdown

Country Count As %
Unknown 7 100%

Demographic breakdown

Readers by professional status Count As %
Researcher 1 14%
Student > Master 1 14%
Student > Bachelor 1 14%
Unknown 4 57%
Readers by discipline Count As %
Engineering 2 29%
Computer Science 1 14%
Unknown 4 57%

This page is provided by Altmetric.