JOURNAL ARTICLE

Directed fixed charge multicommodity network design: A cutting plane approach using polar duality

Yogesh K. AgarwalY.P. AnejaSachin Jayaswal

Year: 2021 Journal:   European Journal of Operational Research Vol: 299 (1)Pages: 118-136   Publisher: Elsevier BV
Keywords:
Knapsack problem Mathematics Cutting-plane method Mathematical optimization Duality gap Solver Duality (order theory) Convex hull Cover (algebra) Integer programming Regular polygon Optimization problem Combinatorics Geometry

Metrics

8
Cited By
0.61
FWCI (Field Weighted Citation Impact)
55
Refs
0.74
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
Urban and Freight Transport Logistics
Physical Sciences →  Engineering →  Building and Construction

Related Documents

JOURNAL ARTICLE

Fixed charge multicommodity network design using p -partition facets

Yogesh K. AgarwalY.P. Aneja

Journal:   European Journal of Operational Research Year: 2016 Vol: 258 (1)Pages: 124-135
JOURNAL ARTICLE

A Cutting Plane Algorithm for Multicommodity Survivable Network Design Problems

Geir DahlMechthild Stoer

Journal:   INFORMS journal on computing Year: 1998 Vol: 10 (1)Pages: 1-11
JOURNAL ARTICLE

Bundle-based relaxation methods for multicommodity capacitated fixed charge network design

Teodor Gabriel CrainicAntonio FrangioniBernard Gendron

Journal:   Discrete Applied Mathematics Year: 2001 Vol: 112 (1-3)Pages: 73-99
© 2026 ScienceGate Book Chapters — All rights reserved.