Pages that link to "Item:Q1131201"

The following pages link to Partitioning procedures for solving mixed-variables programming problems (Q1131201):

Displaying 50 items.

• A two-stage stochastic programming model for transportation network protection (Q960408) (← links)
• A university-timetabling problem and its solution using Benders' partitioning---a case study (Q964875) (← links)
• A Benders decomposition method for solving stochastic complementarity problems with an application in energy (Q967222) (← links)
• An algorithm for stochastic programs with first-order dominance constraints induced by linear recourse (Q968143) (← links)
• Robust network optimization under polyhedral demand uncertainty is \(NP\)-hard (Q968181) (← links)
• Allocation and scheduling of conditional task graphs (Q969530) (← links)
• Towards a practical parallelisation of the simplex method (Q970132) (← links)
• Adaptive multicut aggregation for two-stage stochastic linear programs with recourse (Q976324) (← links)
• Stochastic dynamic programming applied to hydrothermal power systems operation planning based on the convex hull algorithm (Q980598) (← links)
• Integration of strategic and tactical decisions for vendor selection under capacity constraints (Q991379) (← links)
• IIS branch-and-cut for joint chance-constrained stochastic programs and application to optimal vaccine allocation (Q992606) (← links)
• A comparative study of decomposition algorithms for stochastic combinatorial optimization (Q1001189) (← links)
• Practical enhancements to the Magnanti-Wong method (Q1003493) (← links)
• A general algorithm for solving two-stage stochastic mixed \(0-1\) first-stage problems (Q1010269) (← links)
• Enhancements of two-stage stochastic decomposition (Q1010300) (← links)
• A framework for collaborative planning and state-of-the-art (Q1017944) (← links)
• Modeling and optimizing of strategic and tactical production planning in the automotive industry under uncertainty (Q1017975) (← links)
• Using rank-1 lift-and-project closures to generate cuts for 0-1 MIPs, a computational investigation (Q1019294) (← links)
• Analysis of stochastic problem decomposition algorithms in computational grids (Q1026583) (← links)
• Development of a new approach for deterministic supply chain network design (Q1027594) (← links)
• Cut generation for an integrated employee timetabling and production scheduling problem (Q1037686) (← links)
• Discrete time/cost trade-off problem: a decomposition-based solution algorithm for the budget version (Q1040964) (← links)
• Cut generation for an employee timetabling problem (Q1042034) (← links)
• Improving Benders decomposition using a genetic algorithm (Q1042103) (← links)
• The pickup and delivery problem with transfers: formulation and a branch-and-cut solution method (Q1044088) (← links)
• Bender's method revisited (Q1050092) (← links)
• Solving embedded generalized network problems (Q1058978) (← links)
• Capital budgeting with Benders' decomposition (Q1062887) (← links)
• Constructive characterizations of the value function of a mixed-integer program. II (Q1062914) (← links)
• Facility location models for distribution planning (Q1069423) (← links)
• Symmetric duality for disjunctive programming with absolute value functionals (Q1078070) (← links)
• Refining bounds for stochastic linear programs with linearly transformed independent random variables (Q1079127) (← links)
• Local decomposition methods for linear programming (Q1091939) (← links)
• A multicut algorithm for two-stage stochastic linear programs (Q1104862) (← links)
• Strong formulations for mixed integer programming: A survey (Q1121789) (← links)
• Cutting planes and column generation techniques with the projective algorithm (Q1123123) (← links)
• Experiments in integer programming (Q1137509) (← links)
• Investments in stochastic maximum flow networks (Q1176860) (← links)
• Optimality tests for partitioning and sectional search algorithms (Q1178318) (← links)
• Multi-stage stochastic optimization applied to energy planning (Q1181742) (← links)
• Decomposition in global optimization (Q1186267) (← links)
• The vehicle routing problem: An overview of exact and approximate algorithms (Q1198313) (← links)
• Linear mean value cross decomposition: A generalization of the Kornai- Liptak method (Q1203802) (← links)
• A decomposition technique for mixed integer programming problems (Q1206388) (← links)
• Monte Carlo (importance) sampling within a Benders decomposition algorithm for stochastic linear programs (Q1207838) (← links)
• The value function of a mixed integer program: I (Q1241180) (← links)
• An algorithm for the quadratic assignment problem using Benders' decomposition (Q1247369) (← links)
• Unilateral contact, elastoplasticity and complementarity with reference to offshore pipeline design (Q1254133) (← links)
• Hedging exotic derivatives through stochastic optimization (Q1274222) (← links)
• A robustness approach to uncapacitated network design problems (Q1278322) (← links)