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

DOI10.1016/j.ejor.2015.03.039zbMath1346.90587OpenAlexW2032399206MaRDI QIDQ319653

Martine Labbé, Tue Rauff Lind 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)

Related Items

A stochastic multi-stage fixed charge transportation problem: worst-case analysis of the rolling horizon approach

Uses Software

• SCIP
• Knapsack

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• SCIP: solving constraint integer programs
• Nonconvex piecewise linear knapsack problems
• Nonconvex, lower semicontinuous piecewise linear optimization
• A minimal algorithm for the multiple-choice knapsack problem
• Models for representing piecewise linear cost functions
• Lifted cover facets of the 0-1 knapsack polytope with GUB constraints
• Stabilized dynamic constraint aggregation for solving set partitioning problems
• New developments in the primal-dual column generation technique
• Branch-and-Price: Column Generation for Solving Huge Integer Programs
• Mixed-Integer Models for Nonseparable Piecewise-Linear Optimization: Unifying Framework and Extensions
• Cutting planes for branch-and-price algorithms
• A Comparison of Mixed-Integer Programming Models for Nonconvex Piecewise Linear Cost Minimization Problems
• A Branch-and-Cut Algorithm Without Binary Variables for Nonconvex Piecewise Linear Optimization
• Reformulation and Decomposition of Integer Programs
• Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
• Lifted Cover Inequalities for 0-1 Integer Programs: Complexity
• A Computational Study of Search Strategies for Mixed Integer Programming
• Selected Topics in Column Generation
• A dynamic domain contraction algorithm for nonconvex piecewise linear network flow problems