Searching for the Multiplier in One-Constraint Optimization Problems
From MaRDI portal
Publication:5592014
DOI10.1287/opre.18.2.253zbMath0195.49602OpenAlexW1995032206MaRDI QIDQ5592014
Publication date: 1970
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.18.2.253
Related Items (9)
Fundamental properties and pseudo-polynomial-time algorithm for network containership sailing speed optimization ⋮ Some heuristic methods for solving \(p\)-median problems with a coverage constraint ⋮ An anytime algorithm for constrained stochastic shortest path problems with deterministic policies ⋮ Improving the computational efficiency of metric-based spares algorithms ⋮ Ersatzteilbemessung für reparierbare Geräte. Grundlegende Modelle und Verfahren ⋮ Lagrangian relaxation and enumeration for solving constrained shortest-path problems ⋮ Path optimization for the resource-constrained searcher ⋮ A survey of resource constrained shortest path problems: Exact solution approaches ⋮ Dynamic programming using the Fritz-John conditions
This page was built for publication: Searching for the Multiplier in One-Constraint Optimization Problems
