Optimization Algorithms for Networks and Graphs
Regular price
€80.99
14 days return policy
Shipping & Delivery
A01=James Evans
advanced undergraduate textbook
algorithmic graph theory
Author_James Evans
Category=PBCN
combinatorial optimization
complementary
Complementary Slackness Conditions
computational complexity analysis
conditions
costflow
discrete mathematics applications
Double Sweep Algorithm
Dual Variables
Edward Minieka
eq_isMigrated=1
eq_isMigrated=2
eq_nobargain
Euler Tour
Feasible Flow
flow
Flow Units
Floyd Algorithm
Hamiltonian Cycle
James R. Evans
Labeled Vertex
linear
Maximum Branching
Maximum Cardinality Matching
Maximum Flow Algorithm
Maximum Weight Matching
Minimum Cost Flow
Minimum Cost Flow Algorithm
Minimum Cost Flow Problem
Minimum Cost Network Flow Problem
Minimum Spanning Tree
network flow optimization techniques
network optimization methods
Node Arc Incidence Matrix
Odd Degree Vertices
programming
Residual Network
slackness
spanning
Spanning Tree
Traveling Salesman Problem
tree
Undirected Arc
Undirected Graph
units
Product details
- ISBN 9780367402808
- Weight: 771g
- Dimensions: 178 x 229mm
- Publication Date: 11 Sep 2019
- Publisher: Taylor & Francis Ltd
- Publication City/Country: GB
- Product Form: Paperback
Secure
checkout
Fast Shipping
Easy returns
A revised and expanded advanced-undergraduate/graduate text (first ed., 1978) about optimization algorithms for problems that can be formulated on graphs and networks. This edition provides many new applications and algorithms while maintaining the classic foundations on which contemporary algorithm
Evans, James
