A branch-cut-and-price algorithm for the piecewise linear transportation problem

DOI10.1016/J.EJOR.2015.03.039MaRDI QIDQ319653zbMATH OpenOpenAlexFDO

Authors Martine Labbé, Tue R. L. Christensen

Publication date 6 October 2016

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

Full work available at URL https://doi.org/10.1016/j.ejor.2015.03.039

zbMATH Keywords

transportation problembranch-cut-and-pricepiecewise linear

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Transportation, logistics and supply chain management (90B06) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Recommendations

• A restricted-entry method for a transportation problem with piecewise- linear concave costs
• A production-transportation problem with piecewise linear cost structures
• A set covering reformulation of the pure fixed charge transportation problem
• A Branch-and-Bound Method for the Fixed Charge Transportation Problem
• Some branch-and-bound procedures for fixed-cost transportation problems

Cites work

• scientific article; zbMATH DE number 3470175 (Why is no real title available?)
• scientific article; zbMATH DE number 3614502 (Why is no real title available?)
• scientific article; zbMATH DE number 1748493 (Why is no real title available?)
• A Branch-and-Cut Algorithm Without Binary Variables for Nonconvex Piecewise Linear Optimization
• A Computational Study of Search Strategies for Mixed Integer Programming
• A comparison of mixed-integer programming models for nonconvex piecewise linear cost minimization problems
• A dynamic domain contraction algorithm for nonconvex piecewise linear network flow problems
• A minimal algorithm for the multiple-choice knapsack problem
• Branch-and-price: Column generation for solving huge integer programs
• Cutting planes for branch-and-price algorithms
• Lifted Cover Inequalities for 0-1 Integer Programs: Complexity
• Lifted cover facets of the 0-1 knapsack polytope with GUB constraints
• Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
• Mixed-integer models for nonseparable piecewise-linear optimization: unifying framework and extensions
• Models for representing piecewise linear cost functions
• New developments in the primal-dual column generation technique
• Nonconvex piecewise linear knapsack problems
• Nonconvex, lower semicontinuous piecewise linear optimization
• Reformulation and decomposition of integer programs
• SCIP: solving constraint integer programs
• Selected Topics in Column Generation
• Stabilized dynamic constraint aggregation for solving set partitioning problems

Cited in

(3)

• A stochastic multi-stage fixed charge transportation problem: worst-case analysis of the rolling horizon approach
• A branch-and-bound algorithm for the transportation problem with location of \(p\) transshipment points
• An equivalent path functional formulation of branched transportation problems

Describes a project that uses

Uses Software

• SCIP
• Knapsack

This page was built for publication: A branch-cut-and-price algorithm for the piecewise linear transportation problem

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