The following pages link to Gloria Pérez (Q320894):
Displaying 31 items.
- On time stochastic dominance induced by mixed integer-linear recourse in multistage stochastic programs (Q320895) (← links)
- An algorithmic framework for solving large-scale multistage stochastic mixed 0-1 problems with nonsymmetric scenario trees. II: Parallelization (Q336664) (← links)
- Scenario cluster decomposition of the Lagrangian dual in two-stage stochastic mixed 0-1 optimization (Q339591) (← links)
- Rostering in a rail passenger carrier (Q835560) (← links)
- On multistage stochastic integer programming for incorporating logical constraints in asset and liability management under uncertainty (Q839843) (← links)
- BFC-MSMIP: an exact branch-and-fix coordination approach for solving multistage stochastic mixed 0-1 problems (Q839891) (← links)
- On parallelization of a stochastic dynamic programming algorithm for solving large-scale mixed \(0-1\) problems under uncertainty (Q889106) (← links)
- (Q1010268) (redirect page) (← links)
- A general algorithm for solving two-stage stochastic mixed \(0-1\) first-stage problems (Q1010269) (← links)
- On \(BFC-MSMIP\) strategies for scenario cluster partitioning, and twin node family branching selection and bounding for multistage stochastic mixed integer programming (Q1040974) (← links)
- \(O(n \log n)\) procedures for tightening cover inequalities (Q1124826) (← links)
- On using an automatic scheme for obtaining the convex hull defining inequalities of a Weismantel 0-1 knapsack constraint (Q1304779) (← links)
- On the Dietrich-Escudero approach for solving the \(0-1\) knapsack problem with a \(0-1\) objective function (Q1328610) (← links)
- Some properties of cliques in 0-1 mixed integer programs (Q1367871) (← links)
- An approach for strategic supply chain planning under uncertainty based on stochastic 0-1 programming (Q1422876) (← links)
- A parallel branch-and-fix coordination based matheuristic algorithm for solving large sized multistage stochastic mixed 0-1 problems (Q1751680) (← links)
- Erratum: ``An algorithmic framework for solving large scale multistage stochastic mixed 0-1 problems with nonsymmetric scenario trees'' (Q1761163) (← links)
- An algorithmic framework for solving large-scale multistage stochastic mixed 0-1 problems with nonsymmetric scenario trees (Q1762093) (← links)
- \(O(n)\) procedures for identifying maximal cliques and non-dominated extensions of consecutive minimal covers and alternates (Q1804563) (← links)
- An \(O(n \log n)\) procedure for identifying facets of the knapsack polytope. (Q1811629) (← links)
- On using clique overlapping for detecting knapsack constraint redundancy and infeasibility in 0-1 mixed integer programs (Q1814812) (← links)
- A so-called cluster Benders decomposition approach for solving two-stage stochastic linear problems (Q1939068) (← links)
- Lagrangian decomposition for large-scale two-stage stochastic mixed 0-1 problems (Q1939073) (← links)
- Time consistent expected mean-variance in multistage stochastic quadratic optimization: a model and a matheuristic (Q2288876) (← links)
- A two-stage stochastic integer programming approach as a mixture of branch-and-fix coordination and Benders decomposition schemes (Q2480254) (← links)
- The value of the stochastic solution in multistage problems (Q2644427) (← links)
- An exact algorithm for solving large-scale two-stage stochastic mixed-integer problems: some theoretical and experimental aspects (Q2654324) (← links)
- Strategies for LP-based solving a general class of scheduling problems (Q3468869) (← links)
- Staff rostering for the station personnel of a railway company (Q3585718) (← links)
- On solving strong multistage nonsymmetric stochastic mixed 0-1 problems (Q5176358) (← links)
- (Q5416128) (← links)
