Minimizing a sum of staircase functions under linear constraints

DOI10.1080/02331938808843335zbMath0651.90088OpenAlexW2023238751WikidataQ120906744 ScholiaQ120906744MaRDI QIDQ3796985

Roland T. Rust, Cláudio Thomás Bornstein

Publication date: 1988

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331938808843335

zbMATH Keywords

branch and boundbound constraintscapacitated warehouse locationpiecewise-linear programdecreasing ascentnetwork flow constraintsout of kilter methodseparable sum of nondecreasing staircase functions

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Integer programming (90C10) Mixed integer programming (90C11) Deterministic network models in operations research (90B10) Inventory, storage, reservoirs (90B05)

Related Items (3)

Global search algorithms for minimum concave-cost network flow problems ⋮ Minimum concave-cost network flow problems: Applications, complexity, and algorithms ⋮ A Lagrangean heuristic for the facility location problem with staircase costs

Cites Work

• A New Optimization Method for Large Scale Fixed Charge Transportation Problems
• An Efficient Branch and Bound Algorithm for the Capacitated Warehouse Location Problem
• Optimal Facility Location with Concave Costs
• An Algorithm for Separable Nonconvex Programming Problems
• An Implicit Enumeration Algorithm for the Concave Cost Network Flow Problem

This page was built for publication: Minimizing a sum of staircase functions under linear constraints