scientific article; zbMATH DE number 3529629

zbMath0338.90042MaRDI QIDQ4105990

Harlan P. Crowder

Publication date: 1976

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Linear programming (90C05)

Related Items (25)

Multi-item capacitated lot-sizing by a cross decomposition based algorithm ⋮ On some difficult linear programs coming from set partitioning ⋮ Period Decompositions for the Capacitated Lot Sizing Problem with Setup Times ⋮ An extended study on an open-shop scheduling problem using the minimisation of the sum of quadratic completion times ⋮ A posteriori error bounds in linear programming aggregation ⋮ Efficient decomposition and linearization methods for the stochastic transportation problem ⋮ Decomposition and iterative aggregation in hierarchical and decentralised planning structures ⋮ Use of Lagrangian decomposition in supply chain planning ⋮ The prize collecting Steiner tree problem: models and Lagrangian dual optimization approaches ⋮ A simultaneous inventory control and facility location model with stochastic capacity constraints ⋮ A Lagrangian-based heuristic for the capacitated lot-sizing problem in parallel machines ⋮ Aggregation effects in maximum covering models ⋮ Lagrangian relaxation for an inventory location problem with periodic inventory control and stochastic capacity constraints ⋮ The design of multiactivity multifacility systems ⋮ Cost-based filtering for shorter path constraints ⋮ Multi-level multi-item lot size planning with limited resources and general manufacturing structure. ⋮ Linear mean value cross decomposition: A generalization of the Kornai- Liptak method ⋮ A Lagrangian approach for minimum cost single round robin tournaments ⋮ Coordination between strategic forest management and tactical logistic and production planning in the forestry supply chain ⋮ Bundle-based relaxation methods for multicommodity capacitated fixed charge network design ⋮ Um método heurístico baseado em relaxação Lagrangiana para o problema de carregamento de paletes do produtor ⋮ The \(k\)-Cardinality Tree Problem: reformulations and Lagrangian relaxation ⋮ Modeling and Managing Uncertainty in Process Planning and Scheduling ⋮ A Lagrangean heuristic for the facility location problem with staircase costs ⋮ Dual-based heuristics for a hierarchical covering location problem

This page was built for publication: