A continuous strategy to solve a class of discrete optimization problems
From MaRDI portal
Publication:2883574
Recommendations
- A continuous strategy to solve a class of mixed optimization problems
- scientific article; zbMATH DE number 1552036
- Discrete approximation of a problem of continuous programming
- A discretizing algorithm for location problems
- Global optimization for generalized geometric programming problems with discrete variables
Cites work
- scientific article; zbMATH DE number 3537446 (Why is no real title available?)
- scientific article; zbMATH DE number 3272827 (Why is no real title available?)
- A deterministic global optimization algorithm for generalized geometric programming
- A new global optimization algorithm for signomial geometric programming via Lagrangian relaxation
- Global optimization of signomial geometric programming using linear relaxation.
- Investigation of path-following algorithms for signomial geometric programming problems
Cited in
(5)- Discrete Monotonic Optimization with Application to a Discrete Location Problem
- Continuous approaches for solving discrete optimization problems
- A continuous strategy to solve a class of mixed optimization problems
- The discrete ellipsoid covering problem: a discrete geometric programming approach
- APROS: Algorithmic Development Methodology for Discrete-Continuous Optimization Problems
This page was built for publication: A continuous strategy to solve a class of discrete optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2883574)