Algorithms for an integer multicommodity network flow problem with node reliability considerations

DOI10.1007/S10957-013-0378-5MaRDI QIDQ2247900zbMATH OpenOpenAlexFDO

Authors Bita Tadayon, J. Cole Smith

Publication date 30 June 2014

Published in Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10957-013-0378-5

zbMATH Keywords

congestioncutting planesinteger programmingmulticommodity flownode reliabilities

Mathematics Subject Classification ID

Integer programming (90C10) Programming involving graphs or networks (90C35)

Recommendations

• Study on the multicommodity reliability of a capacitated-flow network
• ON A MULTICOMMODITY FLOW NETWORK RELIABILITY MODEL AND ITS APPLICATION TO A CONTAINER-LOADING TRANSPORTATION PROBLEM
• An algorithm to evaluate the system reliability for multicommodity case under cost constraint
• Reliability evaluation of a multicommodity capacitated-flow network in terms of minimal pathsets
• Branch-and-price-and-cut algorithms for solving the reliable \(h\)-paths problem

Cites work

• A multicommodity network-flow problem with side constraints on paths solved by column generation
• A polyhedral approach to an integer multicommodity flow problem
• A simple algorithm for reliability evaluation of a stochastic-flow network with node failure
• A Simplex-Based Tabu Search Method for Capacitated Network Design
• A survey of algorithms for convex multicommodity flow problems
• A Survey of Linear Cost Multicommodity Network Flows
• Backbone Network Design Tools with Economic Tradeoffs
• Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
• scientific article; zbMATH DE number 3174052 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Integer multicommodity flow problems
• Mathematical programming algorithms for two-path routing problems with reliability considerations
• Multicommodity network flows—A survey
• Network Design Using Cut Inequalities
• Network flows. Theory, algorithms, and applications.
• On reliability evaluation of a capacitated‐flow network in terms of minimal pathsets
• Reliability Bounds for Multistate Systems with Multistate Components
• Reliability evaluation of a limited-flow network in terms of minimal cutsets
• Reliability Evaluation of Multistate Systems with Multistate Components
• System-Optimal Routing of Traffic Flows with User Constraints in Networks with Congestion
• Two-commodity reliability evaluation for a stochastic-flow network with node failure

Cited in

(5)

• ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
• QPLIB: a library of quadratic programming instances
• Mathematical programming algorithms for two-path routing problems with reliability considerations
• Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO
• ON A MULTICOMMODITY FLOW NETWORK RELIABILITY MODEL AND ITS APPLICATION TO A CONTAINER-LOADING TRANSPORTATION PROBLEM

This page was built for publication: Algorithms for an integer multicommodity network flow problem with node reliability considerations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2247900)