Discrete optimization with polynomially detectable boundaries and restricted level sets

DOI10.1007/S10878-012-9546-ZMaRDI QIDQ1944392zbMATH OpenOpenAlexFDO

Authors Yakov Zinder, Julia Memar, Gaurav Singh

Publication date 25 March 2013

Published in Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10878-012-9546-z

zbMATH Keywords

discrete optimizationprecedence constraintsscheduling theoryweighted maximum lateness

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Integer programming (90C10)

Recommendations

• Discrete Optimization with Polynomially Detectable Boundaries and Restricted Level Sets
• Problems of discrete optimization: challenges and main approaches to solve them
• scientific article; zbMATH DE number 4023017
• Lösungsverfahren für eine klasse diskreter optimierungsaufgaben spezieller struktur
• Optimality conditions in discrete optimization problems

Cites work

• Complexity of scheduling multiprocessor tasks with prespecified processors allocations
• Complexity of Scheduling under Precedence Constraints
• NP-complete scheduling problems
• Scheduling Tasks with Nonuniform Deadlines on Two Processors

Cited in

(2)

• Discrete Optimization with Polynomially Detectable Boundaries and Restricted Level Sets
• An improved discrete optimisation procedure with comparison to constraint programming

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 Q1944392)