An algebraic geometry algorithm for scheduling in presence of setups and correlated demands
From MaRDI portal
(Redirected from Publication:1906277)
Recommendations
- On some geometric methods in scheduling theory: A survey
- Approximation algorithms for problems in scheduling with set-ups
- The geometry of scheduling
- scientific article; zbMATH DE number 4108474
- On the geometry, preemptions and complexity of multiprocessor and shop scheduling
- On algebraic characterizations in shop scheduling problems
- scientific article; zbMATH DE number 1982192
- scientific article; zbMATH DE number 876684
- On the optimality of exact and approximation algorithms for scheduling problems
Cites work
- A Geometric Buchberger Algorithm for Integer Programming
- A Randomized Algorithm to Optimize Over Certain Convex Sets
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- scientific article; zbMATH DE number 3941661 (Why is no real title available?)
- scientific article; zbMATH DE number 4089320 (Why is no real title available?)
- scientific article; zbMATH DE number 108068 (Why is no real title available?)
- scientific article; zbMATH DE number 177867 (Why is no real title available?)
- Neighborhood Systems for Production Sets with Indivisibilities
- Preprocessing in Stochastic Programming: The Case of Uncapacitated Networks
- Probability Inequalities for Sums of Bounded Random Variables
Cited in
(20)- On some geometric methods in scheduling theory: A survey
- Finding multiplies solutions for non-linear integer programming
- Bounds for probabilistic integer programming problems
- Counting and enumerating feasible rotating schedules by means of Gröbner bases
- 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
- Exact cost minimization of a series-parallel reliable system with multiple component choices using an algebraic method
- Tractable algorithms for chance-constrained combinatorial problems
- New product introduction against a predator: a bilevel mixed-integer programming approach
- scientific article; zbMATH DE number 4108474 (Why is no real title available?)
- An Algorithm to Calculate the Kernel of Certain Polynomial Ring Homomorphisms
- GRIN: an implementation of Gröbner bases for integer programming
- An algebraic approach to integer portfolio problems
- Chance-constrained optimization under limited distributional information: a review of reformulations based on sampling and distributional robustness
- Hyperrectangular partition schemes for two-stage stochastic linear mixed integer programming problems
- Exploring the geometric buchberger algorithm in integer programming
- Integer programming with binary and bounded variables via Gröbner bases with applications to multiobjective integer programming
- An improved test set approach to nonlinear integer problems with applications to engineering design
- Solving chance-constrained combinatorial problems to optimality
- IIS branch-and-cut for joint chance-constrained stochastic programs and application to optimal vaccine allocation
This page was built for publication: An algebraic geometry algorithm for scheduling in presence of setups and correlated demands
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1906277)
