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.
- The mixed postman problem (Q754753) (← links)
- Theoretical properties and numerical tests of an efficient nonlinear decomposition algorithm (Q755430) (← links)
- Large-scale mixed integer programming: Benders-type heuristics (Q789322) (← links)
- Constructive characterizations of the value-function of a mixed-integer program. I (Q798260) (← links)
- Die Bedeutung des Operations Research fuer die hierarchische Produktionsplanung (Q806849) (← links)
- Global optimization algorithms for linearly constrained indefinite quadratic problems (Q810370) (← links)
- An optimal algorithm for the multiproduct capacitated facility location problem with a choice of facility type (Q811349) (← links)
- Multi-period near-equilibrium in a pool-based electricity market including on/off decisions (Q812125) (← links)
- Decomposition branch-and-bound based algorithm for linear programs with additional multiplicative constraints (Q813372) (← links)
- About Lagrangian methods in integer optimization (Q817183) (← links)
- Logic-based modeling and solution of nonlinear discrete/continuous optimization problems (Q817192) (← links)
- Logical processing for integer programming (Q817209) (← links)
- A combined SDDP/Benders decomposition approach with a risk-averse surface concept for reservoir operation in long term power generation planning (Q827142) (← links)
- The stochastic opportunistic replacement problem. III: Improved bounding procedures (Q827144) (← links)
- Multiple allocation hub-and-spoke network design under hub congestion (Q833525) (← links)
- On multistage stochastic integer programming for incorporating logical constraints in asset and liability management under uncertainty (Q839843) (← links)
- On a mixture of the fix-and-relax coordination and Lagrangian substitution schemes for multistage stochastic mixed integer programming (Q839882) (← links)
- BFC-MSMIP: an exact branch-and-fix coordination approach for solving multistage stochastic mixed 0-1 problems (Q839891) (← links)
- On the separability of subproblems in Benders decompositions (Q846136) (← links)
- A generic stochastic model for supply-and-return network design (Q850288) (← links)
- A hybrid method for the planning and scheduling (Q850451) (← links)
- An integrated method for planning and scheduling to minimize tardiness (Q850465) (← links)
- Analysis of decomposition algorithms with Benders cuts for \(p\)-median problem (Q853803) (← links)
- Identifying and exploiting problem structures using explanation-based constraint programming (Q857888) (← links)
- A Benders decomposition algorithm for base station planning problem in WCDMA networks (Q858274) (← links)
- An integrated model for logistics network design (Q867539) (← links)
- An integrated aircraft routing, crew scheduling and flight retiming model (Q868987) (← links)
- Designing cost-effective content distribution networks (Q869005) (← links)
- On a stochastic sequencing and scheduling problem (Q875406) (← links)
- A branch-and-cut algorithm for the continuous error localization problem in data cleaning (Q875426) (← links)
- On the enrouting protocol problem under uncertainty (Q877076) (← links)
- Integer programming models for the \(q\)-mode problem (Q881520) (← links)
- Parking buses in a depot using block patterns: a Benders decomposition approach for minimizing type mismatches (Q883301) (← links)
- On parallelization of a stochastic dynamic programming algorithm for solving large-scale mixed \(0-1\) problems under uncertainty (Q889106) (← links)
- A two-stage coupled algorithm for an integrated maintenance planning and flowshop scheduling problem with deteriorating machines (Q892903) (← links)
- A military maintenance planning and scheduling problem (Q895774) (← links)
- Two bounds for integrating the virtual dynamic cellular manufacturing problem into supply chain management (Q898713) (← links)
- Metric selection in fast dual forward-backward splitting (Q901087) (← links)
- Solving multistage quantified linear optimization problems with the alpha-beta nested Benders decomposition (Q904957) (← links)
- A note on Benders' decomposition in mixed-integer quadratic programming (Q908853) (← links)
- Benders' decomposition for the constrained \(\ell_ 1\)-problem (Q911464) (← links)
- MSLiP: A computer code for the multistage stochastic linear programming problem (Q914552) (← links)
- On the resemblance between the Kornai-Liptak and cross decomposition techniques for block-angular linear programs (Q916562) (← links)
- Exact algorithms for the joint object placement and request routing problem in content distribution networks (Q925830) (← links)
- Exact and heuristic solution approaches for the mixed integer setup knapsack problem (Q928018) (← links)
- Equilibrium prices supported by dual price functions in markets with non-convexities (Q928047) (← links)
- Benders decomposition for the uncapacitated multiple allocation hub location problem (Q941531) (← links)
- Integrated airline scheduling (Q947955) (← links)
- Computing robust basestock levels (Q951115) (← links)
- Hedging options under transaction costs and stochastic volatility (Q951343) (← links)
