Strong inequalities for capacitated survivable network design problems

Daniel Bienstock; Gabriella Muratore

doi:10.1007/pl00011390

ScienceGate Book Chapters

JOURNAL ARTICLE

Strong inequalities for capacitated survivable network design problems

Daniel Bienstock Gabriella Muratore

Year: 2000 Journal: Mathematical Programming Vol: 89 (1)Pages: 127-147 Publisher: Springer Science+Business Media

DOI: 10.1007/pl00011390

Get Full-Text PDF Get Analytical Report

Keywords:

Polyhedron Survivability Mathematics Network planning and design Mathematical optimization Vertex (graph theory) Facet (psychology) Fraction (chemistry) Multi-commodity flow problem Enhanced Data Rates for GSM Evolution Flow network Graph Computer science Computer network Combinatorics Telecommunications

Metrics

Cited By

12.92

FWCI (Field Weighted Citation Impact)

Refs

0.99

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Citation History

Topics

Vehicle Routing Optimization Methods

Physical Sciences → Engineering → Industrial and Manufacturing Engineering

Optimization and Packing Problems

Physical Sciences → Engineering → Industrial and Manufacturing Engineering

Complexity and Algorithms in Graphs

Physical Sciences → Computer Science → Computational Theory and Mathematics

Strong inequalities for capacitated survivable network design problems

Metrics

Citation History

Topics

Related Documents

Partition inequalities for capacitated survivable network design based on directed p-cycles

Survivable network design: the capacitated minimum spanning network problem

Solving survivable two-layer network design problems by metric inequalities

Survivable network design: the capacitated minimum spanning network problem

Stochastic Survivable Network Design Problems