Matheuristics based on iterative linear programming and slope scaling for multicommodity capacitated fixed charge network design
type: Item
instance of: scholarly article
title: Matheuristics based on iterative linear programming and slope scaling for multicommodity capacitated fixed charge network design
zbMATH Open document ID: 1403.90199
author: Bernard Gendron
author: Saïd Hanafi
author: Raca Todosijević
published in: European Journal of Operational Research
publication date: 2018-05-30T00:00:00Z
Mathematics Subject Classification ID: 90B10
Mathematics Subject Classification ID: 90C11
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 6876688
zbMATH Keywords: heuristics
zbMATH Keywords: mixed-integer programming
zbMATH Keywords: multicommodity capacitated fixed charge network design
zbMATH Keywords: iterative linear programming
zbMATH Keywords: slope scaling
MaRDI profile type: Publication
full work available at URL: j.ejor.2018.01.022
OpenAlex ID: W2786155106
cites work: Benders, metric and cutset inequalities for multicommodity capacitated network design
cites work: Accelerating benders decomposition with heuristicmaster problem solutions
cites work: Bundle-based relaxation methods for multicommodity capacitated fixed charge network design
cites work: Q3500141
cites work: A Simplex-Based Tabu Search Method for Capacitated Network Design
cites work: A slope scaling/Lagrangean perturbation heuristic with long-term memory for multicommodity capacitated fixed-charge network design
cites work: A first multilevel cooperative algorithm for capacitated multicommodity network design
cites work: Exploring relaxation induced neighborhoods to improve MIP solutions
cites work: Benchmarking optimization software with performance profiles.
cites work: Local branching
cites work: Bundle methods for sum-functions with ``easy'' components: applications to multicommodity network design
cites work: Branch-and-price-and-cut for large-scale multicommodity capacitated fixed-charge network design
cites work: Cycle-Based Neighbourhoods for Fixed-Charge Capacitated Multicommodity Network Design
cites work: Path relinking, cycle-based neighbourhoods and capacitated multicommodity network design
cites work: Improved convergent heuristics for the 0-1 multidimensional knapsack problem
cites work: Combining exact and heuristic approaches for the capacitated fixed-charge network flow problem
cites work: A Lagrangian Heuristic Based Branch-and-Bound Approach for the Capacitated Network Design Problem
cites work: A COMBINED CAPACITY SCALING AND LOCAL BRANCHING APPROACH FOR CAPACITATED MULTI-COMMODITY NETWORK DESIGN PROBLEM
cites work: A capacity scaling heuristic for the multicommodity capacitated network design problem
cites work: A solution approach to the fixed charge network flow problem using a dynamic slope scaling procedure
cites work: Dynamic slope scaling and trust interval techniques for solving concave piecewise linear network flow problems
cites work: Algorithms – ESA 2005
cites work: A cycle-based evolutionary algorithm for the fixed-charge capacitated multi-commodity network design problem
cites work: A local branching heuristic for the capacitated fixed-charge network design problem
cites work: Q4411416
cites work: Zero-one programming with many variables and few constraints
cites work: New convergent heuristics for 0-1 mixed integer programming
DOI: 10.1016/J.EJOR.2018.01.022
Recommended article: A slope scaling/Lagrangean perturbation heuristic with long-term memory for multicommodity capacitated fixed-charge network design
Recommended article: Q4782149
Recommended article: Bundle-based relaxation methods for multicommodity capacitated fixed charge network design
Recommended article: Node-based Lagrangian relaxations for multicommodity capacitated fixed-charge network design
Recommended article: Formulations for the nonbifurcated hop-constrained multicommodity capacitated fixed-charge network design problem
Recommended article: Branch-and-price-and-cut for large-scale multicommodity capacitated fixed-charge network design
Recommended article: Q4649350
Recommended article: A combined capacity scaling and local branching matheuristic for the hop-constrained multicommodity network design problem
Recommended article: Exact algorithms based on Benders decomposition for multicommodity uncapacitated fixed-charge network design
Recommended article: A dual ascent approach to the fixed-charge capacitated network design problem
description: scientific article; zbMATH DE number 6876688