An algebraic geometry algorithm for scheduling in presence of setups and correlated demands

DOI10.1007/BF01585566zbMath0839.90063DBLPjournals/mp/TayurTN95OpenAlexW2053322468WikidataQ56568571 ScholiaQ56568571MaRDI QIDQ1906277

N. R. Natraj, Sridhar R. Tayur, Rekha R. Thomas

Publication date: 17 March 1996

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01585566

zbMATH Keywords

Gröbner basisparallel machineschance constrained integer program

Mathematics Subject Classification ID

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

Related Items (14)

Exact cost minimization of a series-parallel reliable system with multiple component choices using an algebraic method ⋮ An improved test set approach to nonlinear integer problems with applications to engineering design ⋮ GRIN: An implementation of Gröbner bases for integer programming ⋮ Chance-constrained optimization under limited distributional information: a review of reformulations based on sampling and distributional robustness ⋮ An Algorithm to Calculate the Kernel of Certain Polynomial Ring Homomorphisms ⋮ Solving chance-constrained combinatorial problems to optimality ⋮ An algebraic approach to integer portfolio problems ⋮ IIS branch-and-cut for joint chance-constrained stochastic programs and application to optimal vaccine allocation ⋮ An exact algebraic \(\epsilon \)-constraint method for bi-objective linear integer programming based on test sets ⋮ Accelerated sample average approximation method for two-stage stochastic programming with binary first-stage variables ⋮ Finding multiplies solutions for non-linear integer programming ⋮ Tractable algorithms for chance-constrained combinatorial problems ⋮ New product introduction against a predator: A bilevel mixed-integer programming approach ⋮ Bounds for probabilistic integer programming problems

Cites Work

• Neighborhood Systems for Production Sets with Indivisibilities
• An outer-approximation algorithm for a class of mixed-integer nonlinear programs
• Preprocessing in Stochastic Programming: The Case of Uncapacitated Networks
• A Randomized Algorithm to Optimize Over Certain Convex Sets
• A Geometric Buchberger Algorithm for Integer Programming
• Probability Inequalities for Sums of Bounded Random Variables
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An algebraic geometry algorithm for scheduling in presence of setups and correlated demands