A Continuous Strategy to Solve a Class of Discrete Optimization Problems

DOI10.1016/j.endm.2010.05.036zbMath1237.90184OpenAlexW2019922977MaRDI QIDQ2883574

Roberto Quirino do Nascimento, Edson Figueiredo Lima, Rúbia 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

zbMATH Keywords

global optimizationdiscrete optimizationgeneralized geometric programmingfacility location problems

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Combinatorial optimization (90C27)

Related Items (1)

The discrete ellipsoid covering problem: a discrete geometric programming approach

Cites Work

• Unnamed Item
• Unnamed Item
• A new global optimization algorithm for signomial geometric programming via Lagrangian relaxation
• Investigation of path-following algorithms for signomial geometric programming problems
• Global optimization of signomial geometric programming using linear relaxation.
• A deterministic global optimization algorithm for generalized geometric programming

This page was built for publication: A Continuous Strategy to Solve a Class of Discrete Optimization Problems