A heuristic for the continuous capacity and flow assignment

DOI10.1016/S0377-2217(02)00219-9MaRDI QIDQ1869661zbMATH OpenOpenAlexFDO

Authors M. Queiroz, Carlos jun. Humes

Publication date 28 April 2003

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0377-2217(02)00219-9

zbMATH Keywords

capacity and flow assignmentflowsglobal optimizationHeuristicmulticommodity

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Nonconvex programming, global optimization (90C26) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• scientific article; zbMATH DE number 611144
• A concave link elimination (CLE) procedure and lower bound for concave topology, capacity and flow assignment network design problems
• Combinatorial optimization of capacity and flow assignment problem for unicast and anycast connections with linear and convex objective functions -- exact and heuristic algorithms
• Separable convexification and DCA techniques for capacity and flow assignment problems.
• scientific article; zbMATH DE number 4149863

Cites work

• A Successive Underestimation Method for Concave Minimization Problems
• Elements of Large-Scale Mathematical Programming Part I: Concepts
• Global Maximization of a Convex Function with Linear Inequality Constraints
• scientific article; zbMATH DE number 53116 (Why is no real title available?)
• scientific article; zbMATH DE number 3497901 (Why is no real title available?)
• scientific article; zbMATH DE number 611144 (Why is no real title available?)
• scientific article; zbMATH DE number 1086904 (Why is no real title available?)
• scientific article; zbMATH DE number 3215121 (Why is no real title available?)
• scientific article; zbMATH DE number 3308846 (Why is no real title available?)
• scientific article; zbMATH DE number 3354799 (Why is no real title available?)
• Maximal vectors and multi-objective optimization
• Network flows. Theory, algorithms, and applications.
• Optimal Routing in a Packet-Switched Computer Network
• Solving nonlinear multicommodity flow problems by the analytic center cutting plane method
• The flow deviation method: An approach to store‐and‐forward communication network design
• The projected pairwise multicommodity flow polyhedron

Cited in

(7)

• Heuristics for capacity planning problems with congestion
• A tabu search algorithm for the routing and capacity assignment problem in computer networks
• A concave link elimination (CLE) procedure and lower bound for concave topology, capacity and flow assignment network design problems
• Combinatorial optimization of capacity and flow assignment problem for unicast and anycast connections with linear and convex objective functions -- exact and heuristic algorithms
• Capacity-filtering algorithms for finite-capacity planning of a flexible flow line
• scientific article; zbMATH DE number 611144 (Why is no real title available?)
• Capacity and flow assignment of data networks by generalized Benders decomposition

This page was built for publication: A heuristic for the continuous capacity and flow assignment

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