A heuristic for the continuous capacity and flow assignment

DOI10.1016/S0377-2217(02)00219-9zbMath1037.90060OpenAlexW2083967362MaRDI QIDQ1869661

Marcelo 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

global optimizationflowsHeuristicmulticommoditycapacity and flow assignment

Mathematics Subject Classification ID

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

Related Items (1)

A tabu search algorithm for the routing and capacity assignment problem in computer networks

Cites Work

• Maximal vectors and multi-objective optimization
• Solving nonlinear multicommodity flow problems by the analytic center cutting plane method
• Optimal Routing in a Packet-Switched Computer Network
• Global Maximization of a Convex Function with Linear Inequality Constraints
• A Successive Underestimation Method for Concave Minimization Problems
• The flow deviation method: An approach to store‐and‐forward communication network design
• Elements of Large-Scale Mathematical Programming Part I: Concepts
• The projected pairwise multicommodity flow polyhedron
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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