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

Yogesh K. Agarwal; Y.P. Aneja; Sachin Jayaswal

doi:10.1016/j.ejor.2021.08.043

ScienceGate Book Chapters

JOURNAL ARTICLE

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

Yogesh K. Agarwal Y.P. Aneja Sachin Jayaswal

Year: 2021 Journal: European Journal of Operational Research Vol: 299 (1)Pages: 118-136 Publisher: Elsevier BV

DOI: 10.1016/j.ejor.2021.08.043

Get Full-Text PDF Get Analytical Report

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

Cited By

0.61

FWCI (Field Weighted Citation Impact)

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

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

Metrics

Citation History

Topics

Related Documents

A Cutting-Plane Neighborhood Structure for Fixed-Charge Capacitated Multicommodity Network Design Problem

Fixed charge multicommodity network design using p -partition facets

A Cutting Plane Algorithm for Multicommodity Survivable Network Design Problems

Cycle-Based Neighbourhoods for Fixed-Charge Capacitated Multicommodity Network Design

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