Pages that link to "Item:Q1906277"
From MaRDI portal
The following pages link to An algebraic geometry algorithm for scheduling in presence of setups and correlated demands (Q1906277):
Displaying 14 items.
- Exact cost minimization of a series-parallel reliable system with multiple component choices using an algebraic method (Q336618) (← links)
- An algebraic approach to integer portfolio problems (Q541725) (← links)
- An improved test set approach to nonlinear integer problems with applications to engineering design (Q887181) (← links)
- Solving chance-constrained combinatorial problems to optimality (Q967213) (← links)
- IIS branch-and-cut for joint chance-constrained stochastic programs and application to optimal vaccine allocation (Q992606) (← links)
- Finding multiplies solutions for non-linear integer programming (Q1792079) (← links)
- Bounds for probabilistic integer programming problems (Q1850114) (← links)
- An exact algebraic \(\epsilon \)-constraint method for bi-objective linear integer programming based on test sets (Q2282534) (← links)
- Accelerated sample average approximation method for two-stage stochastic programming with binary first-stage variables (Q2284466) (← links)
- Tractable algorithms for chance-constrained combinatorial problems (Q3632807) (← links)
- New product introduction against a predator: A bilevel mixed-integer programming approach (Q3655566) (← links)
- An Algorithm to Calculate the Kernel of Certain Polynomial Ring Homomorphisms (Q4891845) (← links)
- GRIN: An implementation of Gröbner bases for integer programming (Q5101421) (← links)
- Chance-constrained optimization under limited distributional information: a review of reformulations based on sampling and distributional robustness (Q6114933) (← links)
