September 2014
Intermediate to advanced
448 pages
12h 28m
English
Content preview from Applications of Combinatorial Optimization, 2nd EditionBecome an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
O’Reilly covers everything we've got, with content to help us build a world-class technology community, upgrade the capabilities and competencies of our teams, and improve overall team performance as well as their engagement.I wanted to learn C and C++, but it didn't click for me until I picked up an O'Reilly book. When I went on the O’Reilly platform, I was astonished to find all the books there, plus live events and sandboxes so you could play around with the technology.I’ve been on the O’Reilly platform for more than eight years. I use a couple of learning platforms, but I'm on O'Reilly more than anybody else. When you're there, you start learning. I'm never disappointed.I'm always learning. So when I got on to O'Reilly, I was like a kid in a candy store. There are playlists. There are answers. There's on-demand training. It's worth its weight in gold, in terms of what it allows me to do.
Index
A, B, C, D, E
activity
allocation
static
types
apatial interaction models
apportionment
approximability
approximate separation
assignment problems
bicriteria
Benders decomposition
blocking configuration
branch-and-bound
branch-and-cut
column generation
communications
connectivity
constraints
covering
global (linking)
integrity
local
mutual exclusion
relaxation
reliability
resource
surrogate
covering problem
crew pairing
k-cycle
decomposition
cyclic
Dantzig–Wolfe
Lagrangian
dimensioning law
disjunctive programming
dominance
dynamic
allocation
network
programming
efficiency frontier
elastic demand
EOQ model
exact separation
F, G, H, I, J
facet
FD-UVI
projection method for
simplicial decomposition for
feasible assignment
fixed point
flight service
base
flow problem
flow
deviation
integer
and multiflows
games
cooperative
non-cooperative
theory
Hungarian method
incompatibility groups
inequality methods
interactive procedures
interconnection
inventory
just-in-time
K, L, M, N
keep tools needed soonest (KTNS)
Kleinrock function
label
efficient (non-dominated)
generation (extension)
labeling
lift and project procedure
linear
approximation method
programming
location
of hubs
problems
matching polyhedron
maximum flow
metaheuristics
minimum cost flow problem
minimum cut
minmax objective
modeling
multicriteria
assignment problem
task allocation
multiflow
network design
game
service networks, dynamic formulations
service networks, static formulations
network pricing
non-dominated assignment ...
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.
Read now
Unlock full access
More than 5,000 organizations count on O’Reilly
O’Reilly covers everything we've got, with content to help us build a world-class technology community, upgrade the capabilities and competencies of our teams, and improve overall team performance as well as their engagement.Julian F.
I wanted to learn C and C++, but it didn't click for me until I picked up an O'Reilly book. When I went on the O’Reilly platform, I was astonished to find all the books there, plus live events and sandboxes so you could play around with the technology.Addison B.
I’ve been on the O’Reilly platform for more than eight years. I use a couple of learning platforms, but I'm on O'Reilly more than anybody else. When you're there, you start learning. I'm never disappointed.Amir M.
I'm always learning. So when I got on to O'Reilly, I was like a kid in a candy store. There are playlists. There are answers. There's on-demand training. It's worth its weight in gold, in terms of what it allows me to do.