Solving a network design problem

DOI10.1023/B:ANOR.0000032577.81139.84zbMath1156.90472OpenAlexW2003149804MaRDI QIDQ1876540

Alain Chabrier, Emilie Danna, Laurent Perron, Claude le Pape

Publication date: 20 August 2004

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/b:anor.0000032577.81139.84

zbMATH Keywords

mixed integer programmingnetwork designconstraint programmingbranch and priceindustrial benchmark

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonlinear programming (90C30)

Related Items

Principles for the design of large neighborhood search, Combining Two Structured Domains for Modeling Various Graph Matching Problems, Double resource optimization for a robust computer network subject to a transmission budget, Algorithm unions for solving discrete optimization problems, On algorithm portfolios and restart strategies, Primal Heuristics for Branch and Price: The Assets of Diving Methods, Constraint games for stable and optimal allocation of demands in SDN, Sequencing surgical cases in a day-care environment: an exact branch-and-price approach, 0-1 reformulations of the multicommodity capacitated network design problem, Explanation-based large neighborhood search