↓ Skip to main content

Discrete Optimization and Operations Research

Overview of attention for book
Cover of 'Discrete Optimization and Operations Research'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Algorithmic Issues in Energy-Efficient Computation
  3. Altmetric Badge
    Chapter 2 Discrete Optimization and Operations Research
  4. Altmetric Badge
    Chapter 3 Short Survey on Graph Correlation Clustering with Minimization Criteria
  5. Altmetric Badge
    Chapter 4 Wardrop Equilibrium for Networks with the BPR Latency Function
  6. Altmetric Badge
    Chapter 5 A Review on Network Robustness from an Information Theory Perspective
  7. Altmetric Badge
    Chapter 6 An Iterative Approach for Searching an Equilibrium in Piecewise Linear Exchange Model
  8. Altmetric Badge
    Chapter 7 Handling Scheduling Problems with Controllable Parameters by Methods of Submodular Optimization
  9. Altmetric Badge
    Chapter 8 Constant-Factor Approximations for Cycle Cover Problems
  10. Altmetric Badge
    Chapter 9 Precedence-Constrained Scheduling Problems Parameterized by Partial Order Width
  11. Altmetric Badge
    Chapter 10 A Scheme of Independent Calculations in a Precedence Constrained Routing Problem
  12. Altmetric Badge
    Chapter 11 On Asymptotically Optimal Approach to the m-Peripatetic Salesman Problem on Random Inputs
  13. Altmetric Badge
    Chapter 12 Efficient Randomized Algorithm for a Vector Subset Problem
  14. Altmetric Badge
    Chapter 13 An Algorithm with Approximation Ratio 5/6 for the Metric Maximum m-PSP
  15. Altmetric Badge
    Chapter 14 An Approximation Algorithm for a Problem of Partitioning a Sequence into Clusters with Restrictions on Their Cardinalities
  16. Altmetric Badge
    Chapter 15 A Fully Polynomial-Time Approximation Scheme for a Special Case of a Balanced 2-Clustering Problem
  17. Altmetric Badge
    Chapter 16 PTAS for the Euclidean Capacitated Vehicle Routing Problem in $$R^d$$
  18. Altmetric Badge
    Chapter 17 On Integer Recognition over Some Boolean Quadric Polytope Extension
  19. Altmetric Badge
    Chapter 18 Variable Neighborhood Search-Based Heuristics for Min-Power Symmetric Connectivity Problem in Wireless Networks
  20. Altmetric Badge
    Chapter 19 On the Facets of Combinatorial Polytopes
  21. Altmetric Badge
    Chapter 20 A Branch and Bound Algorithm for a Fractional 0-1 Programming Problem
  22. Altmetric Badge
    Chapter 21 Approximating Coupled-Task Scheduling Problems with Equal Exact Delays
  23. Altmetric Badge
    Chapter 22 Routing Open Shop with Unrelated Travel Times
  24. Altmetric Badge
    Chapter 23 The 2-Machine Routing Open Shop on a Triangular Transportation Network
  25. Altmetric Badge
    Chapter 24 Mixed Integer Programming Approach to Multiprocessor Job Scheduling with Setup Times
  26. Altmetric Badge
    Chapter 25 On Speed Scaling Scheduling of Parallel Jobs with Preemption
  27. Altmetric Badge
    Chapter 26 Facility Location in Unfair Competition
  28. Altmetric Badge
    Chapter 27 Variable Neighborhood Descent for the Capacitated Clustering Problem
  29. Altmetric Badge
    Chapter 28 A Leader-Follower Hub Location Problem Under Fixed Markups
  30. Altmetric Badge
    Chapter 29 Tabu Search Approach for the Bi-Level Competitive Base Station Location Problem
  31. Altmetric Badge
    Chapter 30 Upper Bound for the Competitive Facility Location Problem with Quantile Criterion
  32. Altmetric Badge
    Chapter 31 Fast Primal-Dual Gradient Method for Strongly Convex Minimization Problems with Linear Constraints
  33. Altmetric Badge
    Chapter 32 An Approach to Fractional Programming via D.C. Constraints Problem: Local Search
  34. Altmetric Badge
    Chapter 33 Partial Linearization Method for Network Equilibrium Problems with Elastic Demands
  35. Altmetric Badge
    Chapter 34 Multiple Cuts in Separating Plane Algorithms
  36. Altmetric Badge
    Chapter 35 On the Parameter Control of the Residual Method for the Correction of Improper Problems of Convex Programming
  37. Altmetric Badge
    Chapter 36 On the Merit and Penalty Functions for the D.C. Optimization
  38. Altmetric Badge
    Chapter 37 Application of Supply Function Equilibrium Model to Describe the Interaction of Generation Companies in the Electricity Market
  39. Altmetric Badge
    Chapter 38 Chain Store Against Manufacturers: Regulation Can Mitigate Market Distortion
  40. Altmetric Badge
    Chapter 39 On the Existence of Immigration Proof Partition into Countries in Multidimensional Space
  41. Altmetric Badge
    Chapter 40 Search of Nash Equilibrium in Quadratic n-person Game
  42. Altmetric Badge
    Chapter 41 Convergence of Discrete Approximations of Stochastic Programming Problems with Probabilistic Criteria
  43. Altmetric Badge
    Chapter 42 A Robust Leaky-LMS Algorithm for Sparse System Identification
  44. Altmetric Badge
    Chapter 43 Extended Separating Plane Algorithm and NSO-Solutions of PageRank Problem
  45. Altmetric Badge
    Chapter 44 Location, Pricing and the Problem of Apollonius
  46. Altmetric Badge
    Chapter 45 Variable Neighborhood Search Approach for the Location and Design Problem
  47. Altmetric Badge
    Chapter 46 On a Network Equilibrium Problem with Mixed Demand
Overall attention for this book and its chapters
Altmetric Badge

About this Attention Score

  • Good Attention Score compared to outputs of the same age (69th percentile)
  • Above-average Attention Score compared to outputs of the same age and source (55th percentile)

Mentioned by

twitter
1 X user
wikipedia
1 Wikipedia page

Readers on

mendeley
28 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.
Title
Discrete Optimization and Operations Research
Published by
Lecture notes in computer science, January 2016
DOI 10.1007/978-3-319-44914-2
ISBNs
978-3-31-944913-5, 978-3-31-944914-2
Editors

Yury Kochetov, Michael Khachay, Vladimir Beresnev, Evgeni Nurminski, Panos Pardalos

X Demographics

X Demographics

The data shown below were collected from the profile of 1 X user 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 28 Mendeley readers of this research output. Click here to see the associated Mendeley record.

Geographical breakdown

Country Count As %
Unknown 28 100%

Demographic breakdown

Readers by professional status Count As %
Student > Ph. D. Student 4 14%
Student > Bachelor 3 11%
Professor > Associate Professor 3 11%
Student > Master 2 7%
Other 1 4%
Other 4 14%
Unknown 11 39%
Readers by discipline Count As %
Engineering 5 18%
Mathematics 2 7%
Business, Management and Accounting 2 7%
Chemical Engineering 1 4%
Unspecified 1 4%
Other 2 7%
Unknown 15 54%
Attention Score in Context

Attention Score in Context

This research output has an Altmetric Attention Score of 4. 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 11 August 2017.
All research outputs
#7,243,574
of 22,890,496 outputs
Outputs from Lecture notes in computer science
#2,400
of 8,127 outputs
Outputs of similar age
#117,619
of 393,734 outputs
Outputs of similar age from Lecture notes in computer science
#257
of 582 outputs
Altmetric has tracked 22,890,496 research outputs across all sources so far. This one has received more attention than most of these and is in the 67th percentile.
So far Altmetric has tracked 8,127 research outputs from this source. They receive a mean Attention Score of 5.0. This one has gotten more attention than average, scoring higher than 69% of its peers.
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 393,734 tracked outputs that were published within six weeks on either side of this one in any source. This one has gotten more attention than average, scoring higher than 69% of its contemporaries.
We're also able to compare this research output to 582 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 55% of its contemporaries.