Pages that link to "Item:Q1131201"
From MaRDI portal
The following pages link to Partitioning procedures for solving mixed-variables programming problems (Q1131201):
Displaying 50 items.
- Mean value cross decomposition applied to integer programming problems (Q1278589) (← links)
- Intelligent control and optimization under uncertainty with application to hydro power (Q1278637) (← links)
- MIP modelling of changeovers in production planning and scheduling problems (Q1278814) (← links)
- Using an interior point method for the master problem in a decomposition approach (Q1278995) (← links)
- Optimal solution of cellular manufacturing system design: Bender's decomposition approach (Q1296072) (← links)
- Stabilized column generation (Q1297485) (← links)
- Exact solution of multicommodity network optimization problems with general step cost functions (Q1306346) (← links)
- Multi-stage stochastic linear programs for portfolio optimization (Q1313141) (← links)
- On the equivalence between roof duality and Lagrangian duality for unconstrained \(0\)-\(1\) quadratic programming problems (Q1314325) (← links)
- A set covering reformulation of the pure fixed charge transportation problem (Q1317046) (← links)
- Data parallel computing for network-structured optimization problems (Q1328430) (← links)
- Dynamic factorization in large-scale optimization (Q1330893) (← links)
- Utility least cost planning and the Washington gas integrated model (Q1332806) (← links)
- On using approximations of the Benders master problem (Q1333479) (← links)
- Solving the staircase cost facility location problem with decomposition and piecewise linearization (Q1333508) (← links)
- A constraint generation scheme to probabilistic linear problems with an application to power system expansion planning (Q1339139) (← links)
- Multi-item capacitated lot-sizing by a cross decomposition based algorithm (Q1339158) (← links)
- Duality and statistical tests of optimality for two stage stochastic programs (Q1363429) (← links)
- Decomposition methods in stochastic programming (Q1365061) (← links)
- A number theoretic reformulation and decomposition method for integer programming (Q1394028) (← links)
- Distributed decision making----a unified approach. (Q1405226) (← links)
- BFC, A branch-and-fix coordination algorithmic framework for solving some types of stochastic pure and mixed 0--1 programs. (Q1410308) (← links)
- Constraint programming and operations research (Q1616390) (← links)
- A Benders decomposition-based framework for solving quay crane scheduling problems (Q1622801) (← links)
- New solution approaches for the capacitated supplier selection problem with total quantity discount and activation costs under demand uncertainty (Q1628038) (← links)
- Petroleum refinery optimization (Q1642991) (← links)
- A decomposable self-adaptive projection-based prediction-correction algorithm for convex time space network flow problem (Q1644557) (← links)
- Online spatio-temporal matching in stochastic and dynamic domains (Q1648078) (← links)
- A capacitated hub location problem under hose demand uncertainty (Q1651522) (← links)
- Logic based Benders' decomposition for orthogonal stock cutting problems (Q1652086) (← links)
- Stochastic programming for qualification management of parallel machines in semiconductor manufacturing (Q1652146) (← links)
- A linear programming based heuristic framework for min-max regret combinatorial optimization problems with interval costs (Q1652219) (← links)
- A Benders decomposition based framework for solving cable trench problems (Q1652230) (← links)
- Scenario cluster Lagrangean decomposition for risk averse in multistage stochastic optimization (Q1652363) (← links)
- Benders decomposition applied to a robust multiple allocation incomplete hub location problem (Q1652441) (← links)
- Preemptive rerouting of airline passengers under uncertain delays (Q1652495) (← links)
- Benders decomposition for curriculum-based course timetabling (Q1652557) (← links)
- Branch-and-cut methods for the network design problem with vulnerability constraints (Q1652559) (← links)
- The robust (minmax regret) assembly line worker assignment and balancing problem (Q1652575) (← links)
- Combining Benders decomposition and column generation for multi-activity tour scheduling (Q1652589) (← links)
- A mixed-integer programming approach for locating jamming devices in a flow-jamming attack (Q1652633) (← links)
- Solving a selective dial-a-ride problem with logic-based Benders decomposition (Q1652651) (← links)
- Risk-averse formulations and methods for a virtual power plant (Q1652695) (← links)
- A computational study of exact approaches for the adjustable robust resource-constrained project scheduling problem (Q1654362) (← links)
- From the separation to the intersection sub-problem in Benders decomposition models with prohibitively-many constraints (Q1662655) (← links)
- The design of a reliable and robust hierarchical health service network using an accelerated Benders decomposition algorithm (Q1681158) (← links)
- A node current-based 2-index formulation for the fixed-destination multi-depot travelling salesman problem (Q1681265) (← links)
- Second-order stochastic dominance constrained portfolio optimization: theory and computational tests (Q1681525) (← links)
- Minimum spanning trees with neighborhoods: mathematical programming formulations and solution methods (Q1683122) (← links)
- Benders decomposition and column-and-row generation for solving large-scale linear programs with column-dependent-rows (Q1694312) (← links)
