A continuous strategy to solve a class of discrete optimization problems
From MaRDI portal
Publication:2883574
DOI10.1016/J.ENDM.2010.05.036zbMATH Open1237.90184OpenAlexW2019922977MaRDI QIDQ2883574FDOQ2883574
Authors: Roberto Quirino Do Nascimento, Edson jun. Figueiredo Lima, Rubia Mara De Oliveira Santos 
Publication date: 13 May 2012
Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.endm.2010.05.036
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
- Global optimization of signomial geometric programming using linear relaxation.
- 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
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)
