APROS: Algorithmic Development Methodology for Discrete-Continuous Optimization Problems
DOI10.1287/OPRE.37.6.902zbMATH Open0689.90058OpenAlexW2143686803MaRDI QIDQ3032084FDOQ3032084
Authors: Granville E. Paules IV, Christodoulos A. Floudas 
Publication date: 1989
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.37.6.902
Recommendations
- scientific article; zbMATH DE number 3922375
- Continuous approaches for solving discrete optimization problems
- scientific article; zbMATH DE number 3679539
- A problem reduction based approach to discrete optimization algorithm design
- scientific article; zbMATH DE number 1552036
- An optimization method for solving mixed discrete-continuous programming problems
- scientific article; zbMATH DE number 4167852
- Algorithms for solving a separable problem of discrete optimization
- scientific article; zbMATH DE number 3978825
- A continuous strategy to solve a class of discrete optimization problems
Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Nonlinear programming (90C30) Integer programming (90C10) Mixed integer programming (90C11) Decomposition methods (49M27)
Cited In (7)
- A novel clustering approach and prediction of optimal number of clusters: global optimum search with enhanced positioning
- An improved branch and bound algorithm for mixed integer nonlinear programs
- An MINLP retrofit approach for improving the flexibility of heat exchanger networks
- Utility least cost planning and the Washington gas integrated model
- A two‐step method for mixed‐integer nonlinear programming problems
- A decomposition approach for global optimum search in QP, NLP and MINLP problems
- A computational comparison of branch and bound and outer approximation algorithms for 0-1 mixed integer nonlinear programs
Uses Software
This page was built for publication: APROS: Algorithmic Development Methodology for Discrete-Continuous Optimization Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3032084)
