Partitioning procedures for solving mixed-variables programming problems
From MaRDI portal
Publication:1131201
DOI10.1007/BF01386316zbMath0109.38302OpenAlexW2044121814WikidataQ89256191 ScholiaQ89256191MaRDI QIDQ1131201
Publication date: 1962
Published in: Numerische Mathematik (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/131533
Related Items (only showing first 100 items - show all)
A decomposition approach for an equipment selection and multiple product routing problem incorporating environmental factors ⋮ Sample average approximation for stochastic nonconvex mixed integer nonlinear programming via outer-approximation ⋮ Network planning under uncertainty with an application to hydropower generation ⋮ Multi-manned assembly line balancing problem with dependent task times: a heuristic based on solving a partition problem with constraints ⋮ Towards a sustainable power grid: stochastic hierarchical planning for high renewable integration ⋮ Epigraphical nesting: A unifying theory for the convergence of algorithms ⋮ Benders decomposition applied to profit maximizing hub location problem with incomplete hub network ⋮ Exact method to optimize the total electricity cost in two-machine permutation flow shop scheduling problem under time-of-use tariff ⋮ Model and solution method for mean-risk cost-based post-disruption restoration of interdependent critical infrastructure networks ⋮ Scheduling with divisible jobs and subcontracting option ⋮ Stochastic hub location problems with Bernoulli demands ⋮ A matheuristic approach for optimizing mineral value chains under uncertainty ⋮ Refinery units maintenance scheduling using integer programming ⋮ SIR epidemics with state-dependent costs and ICU constraints: a Hamilton-Jacobi verification argument and dual LP algorithms ⋮ A logic-based Benders decomposition for microscopic railway timetable planning ⋮ Multi-period green reverse logistics network design: an improved Benders-decomposition-based heuristic approach ⋮ Efficient decomposition and linearization methods for the stochastic transportation problem ⋮ Discrete dynamical system approaches for Boolean polynomial optimization ⋮ Robust min-max regret covering problems ⋮ Shattering inequalities for learning optimal decision trees ⋮ Parallel decomposition of large-scale stochastic nonlinear programs ⋮ Feasibility in uncapacitated networks: The effect of individual arcs and nodes ⋮ Packing Steiner trees: A cutting plane algorithm and computational results ⋮ Equilibrium refinement for a model of non-monocentric internal structures of cities: a potential game approach ⋮ Long range planning in the process industries: A projection approach ⋮ A cutting plane method from analytic centers for stochastic programming ⋮ Portfolio problems with two levels decision-makers: optimal portfolio selection with pricing decisions on transaction costs ⋮ Enhancing Benders decomposition algorithm to solve a combat logistics problem ⋮ Decomposition strategy for the stochastic pooling problem ⋮ Optimal arrangements of hyperplanes for SVM-based multiclass classification ⋮ Exact algorithms to minimize makespan on single and parallel batch processing machines ⋮ A stochastic programming model with endogenous and exogenous uncertainty for reliable network design under random disruption ⋮ A Benders decomposition-based approach for logistics service network design ⋮ Branch-relax-and-check: a tractable decomposition method for order acceptance and identical parallel machine scheduling ⋮ Fenchel decomposition for stochastic mixed-integer programming ⋮ A so-called cluster Benders decomposition approach for solving two-stage stochastic linear problems ⋮ Inexact solution of NLP subproblems in MINLP ⋮ Totally unimodular stochastic programs ⋮ A two-stage robust model for a reliable \(p\)-center facility location problem ⋮ Cargo allocation and vessel scheduling on liner shipping with synchronization of transshipments ⋮ Decision-dependent probabilities in stochastic programs with recourse ⋮ The determination of optimal treatment plans for volumetric modulated arc therapy (VMAT) ⋮ Solving the optimum communication spanning tree problem ⋮ A Benders' decomposition algorithm with combinatorial cuts for the multi-manned assembly line balancing problem ⋮ Network design model to integrate shelter assignment with contraflow operations in emergency evacuation planning ⋮ Benders decomposition algorithms for two variants of the single allocation hub location problem ⋮ A joint decomposition method for global optimization of multiscenario nonconvex mixed-integer nonlinear programs ⋮ Global optimization of multilevel electricity market models including network design and graph partitioning ⋮ Exact solution algorithms for the maximum flow problem with additional conflict constraints ⋮ A multistage stochastic programming approach for preventive maintenance scheduling of GENCOs with natural gas contract ⋮ An exact solution method for the TSP with drone based on decomposition ⋮ Adjustable robust balanced hub location problem with uncertain transportation cost ⋮ Accelerating Benders decomposition for short-term hydropower maintenance scheduling ⋮ Exact solution techniques for two-dimensional cutting and packing ⋮ On single-source capacitated facility location with cost and fairness objectives ⋮ The multiple multidimensional knapsack with family-split penalties ⋮ Capacitated multi-period maximal covering location problem with server uncertainty ⋮ Implementing the branch-and-cut approach for a general purpose Benders' decomposition framework ⋮ A combinatorial Benders decomposition algorithm for parallel machine scheduling with working-time restrictions ⋮ Benders decomposition for a stochastic three-level lot sizing and replenishment problem with a distribution structure ⋮ An exact algorithm for the unidirectional quay crane scheduling problem with vessel stability ⋮ A simulation-based decomposition approach for two-stage staffing optimization in call centers under arrival rate uncertainty ⋮ Benders' decomposition for the balancing of assembly lines with stochastic demand ⋮ A robust optimization approach for the multi-mode resource-constrained project scheduling problem ⋮ Stochastic dynamic cutting plane for multistage stochastic convex programs ⋮ Regularized decomposition of large scale block-structured robust optimization problems ⋮ Partially distributed outer approximation ⋮ Hierarchical design of an integrated production and 2-echelon distribution system ⋮ Stepwise decomposition approaches for large scale cell formation problems ⋮ Exact solution methods for uncapacitated location problems with convex transportation costs ⋮ A demand-shifting feasibility algorithm for Benders decomposition. ⋮ Logic-based Benders decomposition method for the \textit{seru} scheduling problem with sequence-dependent setup time and DeJong's learning effect ⋮ Design and implementation of a modular interior-point solver for linear optimization ⋮ Benders decomposition with adaptive oracles for large scale optimization ⋮ A stochastic approximation method for approximating the efficient frontier of chance-constrained nonlinear programs ⋮ A parallelized variable fixing process for solving multistage stochastic programs with progressive hedging ⋮ Refined cut selection for Benders decomposition: applied to network capacity expansion problems ⋮ Combining Dantzig-Wolfe and Benders decompositions to solve a large-scale nuclear outage planning problem ⋮ Routing for unmanned aerial vehicles: touring dimensional sets ⋮ A tailored Benders decomposition approach for last-mile delivery with autonomous robots ⋮ A complementarity model for electric power transmission-distribution coordination under uncertainty ⋮ An extended enterprise planning methodology for the discrete manufacturing industry ⋮ An algorithm for optimizing network flow capacity under economies of scale ⋮ Characterization of local solutions for a class of nonconvex programs ⋮ Modeling and design of global logistics systems: a review of integrated strategic and tactical models and design algorithms ⋮ An outer-approximation guided optimization approach for constrained neural network inverse problems ⋮ A framework for generalized Benders' decomposition and its application to multilevel optimization ⋮ On sample average approximation for two-stage stochastic programs without relatively complete recourse ⋮ Bi-objective multistage stochastic linear programming ⋮ Stochastic dual dynamic programming for multistage stochastic mixed-integer nonlinear optimization ⋮ Non-convex nested Benders decomposition ⋮ Robust alternative fuel refueling station location problem with routing under decision-dependent flow uncertainty ⋮ A Benders decomposition algorithm for the maximum availability service facility location problem ⋮ Multistage adaptive robust optimization for the hydrothermal scheduling problem ⋮ Bi-objective optimisation over a set of convex sub-problems ⋮ An L-shaped method with strengthened lift-and-project cuts ⋮ Meta partial Benders decomposition for the logistics service network design problem ⋮ Extensions for Benders cuts and new valid inequalities for solving the European day-ahead electricity market clearing problem efficiently ⋮ Strengthening of feasibility cuts in logic-based benders decomposition ⋮ Logic-based benders decomposition for an inter-modal transportation problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A Nonlinear Programming Technique for the Optimization of Continuous Processing Systems
- On the Significance of Solving Linear Programming Problems with Some Integer Variables
- Decomposition Principle for Linear Programs
- The Cutting-Plane Method for Solving Convex Programs
- The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints
- An Automatic Method of Solving Discrete Programming Problems
This page was built for publication: Partitioning procedures for solving mixed-variables programming problems
