Discrete Optimization with Polynomially Detectable Boundaries and Restricted Level Sets

DOI10.1007/978-3-642-17458-2_13zbMath1311.90129OpenAlexW2101503489MaRDI QIDQ3066152

Gaurav Singh, Yakov Zinder, Julia Memar

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

parallel machinesscheduling theorydiscrete optimizationunit execution times

Mathematics Subject Classification ID

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

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