Searching for the Multiplier in One-Constraint Optimization Problems
From MaRDI portal
Publication:5592014
DOI10.1287/OPRE.18.2.253zbMATH Open0195.49602OpenAlexW1995032206MaRDI QIDQ5592014FDOQ5592014
Authors: Bennett L. Fox, D. M. Landi 
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
Cited In (9)
- Lagrangian relaxation and enumeration for solving constrained shortest-path problems
- An anytime algorithm for constrained stochastic shortest path problems with deterministic policies
- Improving the computational efficiency of metric-based spares algorithms
- Fundamental properties and pseudo-polynomial-time algorithm for network containership sailing speed optimization
- Ersatzteilbemessung für reparierbare Geräte. Grundlegende Modelle und Verfahren
- Some heuristic methods for solving \(p\)-median problems with a coverage constraint
- A survey of resource constrained shortest path problems: exact solution approaches
- Dynamic programming using the Fritz-John conditions
- Path optimization for the resource-constrained searcher
This page was built for publication: Searching for the Multiplier in One-Constraint Optimization Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5592014)
