A continuous strategy to solve a class of mixed optimization problems
From MaRDI portal
Publication:496673
DOI10.1016/J.DAM.2011.12.008zbMATH Open1331.90054OpenAlexW2175279618MaRDI QIDQ496673FDOQ496673
Authors: Roberto Quirino Do Nascimento, Edson jun. Figueiredo Lima, Rubia Mara De Oliveira Santos 
Publication date: 22 September 2015
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2011.12.008
Recommendations
- A continuous strategy to solve a class of discrete optimization problems
- An optimization method for solving mixed discrete-continuous programming problems
- An exact penalty function method for nonlinear mixed discrete programming problems
- Global optimization for generalized geometric programs with mixed free-sign variables
- Global optimization for generalized geometric programming problems with discrete variables
Cites Work
- Global optimization of signomial geometric programming using linear relaxation.
- A new rectangle branch-and-pruning approach for generalized geometric programming
- A new global optimization algorithm for signomial geometric programming via Lagrangian relaxation
- A deterministic global optimization algorithm for generalized geometric programming
- Title not available (Why is that?)
- Title not available (Why is that?)
- Investigation of path-following algorithms for signomial geometric programming problems
- On the mixed integer signomial programming problems
Cited In (3)
This page was built for publication: A continuous strategy to solve a class of mixed optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q496673)
