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.
- Optimal power management of a DISCO with integrations of reliability considerations and wind farm based on Benders decomposition (Q410552) (← links)
- Stochastic uncapacitated hub location (Q421562) (← links)
- Formulations and Benders decomposition algorithms for multidepot salesmen problems with load balancing (Q421709) (← links)
- Adaptive and nonadaptive approaches to statistically based methods for solving stochastic linear programs: a computational investigation (Q429477) (← links)
- Recourse-based stochastic nonlinear programming: properties and Benders-SQP algorithms (Q434187) (← links)
- Optimizing system resilience: a facility protection model with recovery time (Q439415) (← links)
- Stochastic dual dynamic programming applied to nonconvex hydrothermal models (Q439570) (← links)
- Strong and compact relaxations in the original space using a compact extended formulation (Q458127) (← links)
- Column generation for extended formulations (Q458128) (← links)
- Group preference modeling for intelligent shared environments: social welfare beyond the sum (Q506766) (← links)
- Benders decomposition for set covering problems. Almost satisfying the consecutive ones property (Q512865) (← links)
- Detecting large risk-averse 2-clubs in graphs with random edge failures (Q513610) (← links)
- Contingency-constrained unit commitment with post-contingency corrective recourse (Q513648) (← links)
- IP over 40+ years at IBM scientific centers and marketing (Q537612) (← links)
- An integer \(L\)-shaped algorithm for the dial-a-ride problem with stochastic customer delays (Q540153) (← links)
- Exact approaches for integrated aircraft fleeting and routing at TunisAir (Q540645) (← links)
- Optimal resource allocation and scheduling for the CELL BE platform (Q545538) (← links)
- An efficient procedure for the N-city traveling salesman problem (Q583107) (← links)
- A Benders decomposition based heuristic for the hierarchical production planning problem (Q584066) (← links)
- A branch and bound algorithm for the capacitated vehicle routing problem (Q585095) (← links)
- Multistage system planning for hydrogen production and distribution (Q613565) (← links)
- Stochastic and risk management models and solution algorithm for natural gas transmission network expansion and LNG terminal location planning (Q613606) (← links)
- On 2-stage robust LP with RHS uncertainty: complexity results and applications (Q628752) (← links)
- Benders, metric and cutset inequalities for multicommodity capacitated network design (Q632387) (← links)
- Exact and heuristic algorithms for the interval data robust assignment problem (Q632649) (← links)
- An interior point cutting plane heuristic for mixed integer programming (Q632679) (← links)
- Integrated supply chain planning under uncertainty using an improved stochastic approach (Q636501) (← links)
- Tree network design avoiding congestion (Q646180) (← links)
- The analysis of the stability of some integer programming algorithms with respect to the objective function (Q647857) (← links)
- Generalized Benders' decomposition for topology optimization problems (Q652657) (← links)
- Nonconvex generalized Benders decomposition for stochastic separable mixed-integer nonlinear programs (Q662860) (← links)
- Almost robust discrete optimization (Q666949) (← links)
- Augmented Lagrangian method within L-shaped method for stochastic linear programs (Q669327) (← links)
- Improved combinatorial Benders decomposition for a scheduling problem with unrelated parallel machines (Q670464) (← links)
- Using central prices in the decomposition of linear programs (Q684317) (← links)
- Combined branch-and-bound and cutting plane methods for solving a class of nonlinear programming problems (Q686998) (← links)
- Mixed-integer bilinear programming problems (Q687032) (← links)
- The integer \(L\)-shaped method for stochastic integer programs with complete recourse (Q688927) (← links)
- Decomposition in general mathematical programming (Q689140) (← links)
- Bounding multi-stage stochastic programs from above (Q689156) (← links)
- Polylithic modeling and solution approaches using algebraic modeling systems (Q691438) (← links)
- Convergence and application of a decomposition method using duality bounds for nonconvex global optimization (Q700712) (← links)
- A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery (Q705506) (← links)
- Stochastic allocation and scheduling for conditional task graphs in multi-processor systems-on-chip (Q707694) (← links)
- Stochastic set packing problem (Q713096) (← links)
- Two-stage robust mixed integer programming problem with objective uncertainty (Q723485) (← links)
- Solving an integrated job-shop problem with human resource constraints (Q744642) (← links)
- Buffer allocation in stochastic flow lines via sample-based optimization with initial bounds (Q747748) (← links)
- Parallel processors for planning under uncertainty (Q751510) (← links)
- On the convergence of cross decomposition (Q752000) (← links)
