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

DOI10.1016/J.EJOR.2015.03.039zbMATH Open1346.90587OpenAlexW2032399206MaRDI QIDQ319653FDOQ319653

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

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

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)

Cites Work

• SCIP: solving constraint integer programs
• A Computational Study of Search Strategies for Mixed Integer Programming
• Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
• Selected Topics in Column Generation
• New developments in the primal-dual column generation technique
• Branch-and-price: Column generation for solving huge integer programs
• Title not available (Why is that?)
• Mixed-integer models for nonseparable piecewise-linear optimization: unifying framework and extensions
• Title not available (Why is that?)
• A minimal algorithm for the multiple-choice knapsack problem
• A Branch-and-Cut Algorithm Without Binary Variables for Nonconvex Piecewise Linear Optimization
• 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
• Cutting planes for branch-and-price algorithms
• A comparison of mixed-integer programming models for nonconvex piecewise linear cost minimization problems
• Reformulation and decomposition of integer programs
• Lifted Cover Inequalities for 0-1 Integer Programs: Complexity
• Title not available (Why is that?)
• A dynamic domain contraction algorithm for nonconvex piecewise linear network flow problems
• Nonconvex piecewise linear knapsack problems
• Nonconvex, lower semicontinuous piecewise linear optimization

Cited In (3)

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

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)