Discrete Optimization with Polynomially Detectable Boundaries and Restricted Level Sets

DOI10.1007/978-3-642-17458-2_13MaRDI QIDQ3066152zbMATH OpenOpenAlexFDO

Authors Yakov Zinder, Julia Memar, Gaurav Singh

Publication date 8 January 2011

Published in Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-17458-2_13

zbMATH Keywords

discrete optimizationparallel machinesscheduling theoryunit execution times

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• Discrete optimization with polynomially detectable boundaries and restricted level sets
• Approximation and optimization of polyhedral discrete and differential inclusions
• scientific article; zbMATH DE number 2159269
• Polyhedral aspects of discrete optimization
• Lagrangian bounds in multiextremal polynomial and discrete optimization problems
• On optimality conditions for a convex optimization problem with polyhedral discrete inclusions
• Polynomials nonnegative on a grid and discrete optimization
• Level-set methods for convex optimization
• Approximation algorithms for discrete polynomial optimization
• Nonlinear Optimization: On Connected Components of Level Sets

Cited in

(1)

• Discrete optimization with polynomially detectable boundaries and restricted level sets

This page was built for publication: Discrete Optimization with Polynomially Detectable Boundaries and Restricted Level Sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3066152)