The Discrete Heal Algorithm With Intermediate Goods
DOI10.2307/2297424zbMATH Open0549.90021OpenAlexW2062505190MaRDI QIDQ3342166FDOQ3342166
Authors: Jacques Crémer
Publication date: 1983
Published in: Review of Economic Studies (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2297424
Recommendations
- Heuristic procedures for solving the discrete ordered median problem
- Heuristic and Special Case Algorithms for Dispersion Problems
- The discrete time/cost trade-off problem: Extensions and heuristic procedures
- The discrete search problem and the construction of optimal allocations
- scientific article; zbMATH DE number 1159798
- On a primal-proximal heuristic in discrete optimization
- Interval algorithms and their application to discrete optimization of multistep processes
- Heuristics for the capacitated dispersion problem
- Approximation algorithms for the discrete time-cost tradeoff problem
- scientific article
stability theorycritical production programdiscrete-time planning proceduresreturns to scale and intermediate goods
Applications of mathematical programming (90C90) Nonlinear programming (90C30) Production theory, theory of the firm (91B38) Stability theory for smooth dynamical systems (37C75) Economic growth models (91B62)
Cited In (2)
This page was built for publication: The Discrete Heal Algorithm With Intermediate Goods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3342166)