↓ Skip to main content

Combinatorial Optimization

Overview of attention for book
Cover of 'Combinatorial Optimization'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Maximum Throughput Network Routing Subject to Fair Flow Allocation
  3. Altmetric Badge
    Chapter 2 Study of Identifying Code Polyhedra for Some Families of Split Graphs
  4. Altmetric Badge
    Chapter 3 Parametric Multiroute Flow and Its Application to Robust Network with \(k\) Edge Failures
  5. Altmetric Badge
    Chapter 4 The Dominating Set Polytope via Facility Location
  6. Altmetric Badge
    Chapter 5 Solving Graph Partitioning Problems Arising in Tagless Cache Management
  7. Altmetric Badge
    Chapter 6 Lagrangean Decomposition for Mean-Variance Combinatorial Optimization
  8. Altmetric Badge
    Chapter 7 Maximum Generalized Assignment with Convex Costs
  9. Altmetric Badge
    Chapter 8 An Integer Programming Formulation for the Maximum k-Subset Intersection Problem
  10. Altmetric Badge
    Chapter 9 b-Coloring is NP-Hard on Co-Bipartite Graphs and Polytime Solvable on Tree-Cographs
  11. Altmetric Badge
    Chapter 10 Proactive Reactive Scheduling in Resource Constrained Projects with Flexibility and Quality Robustness Requirements
  12. Altmetric Badge
    Chapter 11 Active Set Methods with Reoptimization for Convex Quadratic Integer Programming
  13. Altmetric Badge
    Chapter 12 Fixed-Parameter Algorithms for Scaffold Filling
  14. Altmetric Badge
    Chapter 13 Finding Totally Independent Spanning Trees with Linear Integer Programming
  15. Altmetric Badge
    Chapter 14 Coupled-Tasks in Presence of Bipartite Compatibilities Graphs
  16. Altmetric Badge
    Chapter 15 The Computational Complexity of Stochastic Optimization
  17. Altmetric Badge
    Chapter 16 A Hybrid Heuristic Approach Based on a Quadratic Knapsack Formulation for the Max-Mean Dispersion Problem
  18. Altmetric Badge
    Chapter 17 A Constraint Generation Approach for the Two-Machine Flow Shop Problem with Jobs Selection
  19. Altmetric Badge
    Chapter 18 Rectilinear Shortest Path and Rectilinear Minimum Spanning Tree with Neighborhoods
  20. Altmetric Badge
    Chapter 19 Lovász and Schrijver \(N_+\) -Relaxation on Web Graphs
  21. Altmetric Badge
    Chapter 20 The Envy-Free Pricing Problem and Unit-Demand Markets
  22. Altmetric Badge
    Chapter 21 Mathematical Programming Models for Traffic Engineering in Ethernet Networks Implementing the Multiple Spanning Tree Protocol
  23. Altmetric Badge
    Chapter 22 Graph Compact Orthogonal Layout Algorithm
  24. Altmetric Badge
    Chapter 23 State Space Reduced Dynamic Programming for the Aircraft Sequencing Problem with Constrained Position Shifting
  25. Altmetric Badge
    Chapter 24 Decomposition Algorithm for the Single Machine Scheduling Polytope
  26. Altmetric Badge
    Chapter 25 Subexponential Fixed-Parameter Algorithms for Partial Vector Domination
  27. Altmetric Badge
    Chapter 26 Efficient Approximation Schemes for the Maximum Lateness Minimization on a Single Machine with a Fixed Operator or Machine Non-Availability Interval
  28. Altmetric Badge
    Chapter 27 A Multi-period Bi-level Stochastic Programming with Decision Dependent Uncertainty in Supply Chains
  29. Altmetric Badge
    Chapter 28 \(\{k\}\) -Packing Functions of Graphs
  30. Altmetric Badge
    Chapter 29 Robust Shift Scheduling in Call Centers
  31. Altmetric Badge
    Chapter 30 A Tabu Search Heuristic for the Equitable Coloring Problem
  32. Altmetric Badge
    Chapter 31 Linear Arrangement Problems and Interval Graphs
  33. Altmetric Badge
    Chapter 32 On the Asymmetric Connected Facility Location Polytope
  34. Altmetric Badge
    Chapter 33 Heuristic Approaches for the Robust Vehicle Routing Problem
  35. Altmetric Badge
    Chapter 34 A Fast Large Neighborhood Search for Disjunctively Constrained Knapsack Problems
  36. Altmetric Badge
    Chapter 35 Approximating the \(k\) -Set Packing Problem by Local Improvements
  37. Altmetric Badge
    Chapter 36 Multi-Objective Cuckoo Search with Leader Selection Strategies
  38. Altmetric Badge
    Chapter 37 Vulnerability Assessment of Spatial Networks: Models and Solutions
Attention for Chapter 22: Graph Compact Orthogonal Layout Algorithm
Altmetric Badge

About this Attention Score

  • Above-average Attention Score compared to outputs of the same age and source (61st percentile)

Mentioned by

twitter
2 X users

Citations

dimensions_citation
2 Dimensions

Readers on

mendeley
9 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
Graph Compact Orthogonal Layout Algorithm
Chapter number 22
Book title
Combinatorial Optimization
Published in
arXiv, January 2014
DOI 10.1007/978-3-319-09174-7_22
Book ISBNs
978-3-31-909173-0, 978-3-31-909174-7
Authors

Kārlis Freivalds, Jans Glagoļevs, Karlis Freivalds, Jans Glagolevs

Editors

Pierre Fouilhoux, Luis Eduardo Neves Gouveia, A. Ridha Mahjoub, Vangelis T. Paschos

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 9 Mendeley readers of this research output. Click here to see the associated Mendeley record.

Geographical breakdown

Country Count As %
Unknown 9 100%

Demographic breakdown

Readers by professional status Count As %
Student > Ph. D. Student 3 33%
Student > Master 2 22%
Other 2 22%
Researcher 1 11%
Unknown 1 11%
Readers by discipline Count As %
Computer Science 4 44%
Engineering 2 22%
Physics and Astronomy 1 11%
Agricultural and Biological Sciences 1 11%
Unknown 1 11%
Attention Score in Context

Attention Score in Context

This research output has an Altmetric Attention Score of 1. This is our high-level measure of the quality and quantity of online attention that it has received. This Attention Score, as well as the ranking and number of research outputs shown below, was calculated when the research output was last mentioned on 26 July 2018.
All research outputs
#18,833,474
of 24,002,307 outputs
Outputs from arXiv
#482,126
of 1,011,770 outputs
Outputs of similar age
#228,333
of 313,391 outputs
Outputs of similar age from arXiv
#2,641
of 10,647 outputs
Altmetric has tracked 24,002,307 research outputs across all sources so far. This one is in the 18th percentile – i.e., 18% of other outputs scored the same or lower than it.
So far Altmetric has tracked 1,011,770 research outputs from this source. They receive a mean Attention Score of 4.0. This one is in the 41st percentile – i.e., 41% of its peers scored the same or lower than it.
Older research outputs will score higher simply because they've had more time to accumulate mentions. To account for age we can compare this Altmetric Attention Score to the 313,391 tracked outputs that were published within six weeks on either side of this one in any source. This one is in the 24th percentile – i.e., 24% of its contemporaries scored the same or lower than it.
We're also able to compare this research output to 10,647 others from the same source and published within six weeks on either side of this one. This one has gotten more attention than average, scoring higher than 61% of its contemporaries.