Partitioning procedures for solving mixed-variables programming problems

Related Items

Natural gas production network infrastructure development under uncertainty, A Benders' decomposition algorithm for optimizing distribution of perishable products considering postharvest biological behavior in agri-food supply chain: a case study of tomato, Symbolic integration of logic in MILP branch and bound methods for the synthesis of process networks, The multi-layered network design problem, Inexact stabilized Benders' decomposition approaches with application to chance-constrained problems with finite support, Solving dynamic stochastic economic models by mathematical programming decomposition methods, Solving a capacitated hub location problem, Application of Benders' decomposition to power plant preventive maintenance scheduling, Dynamic supply chain design with inventory, Comparisons and enhancement strategies for linearizing mixed 0-1 quadratic programs, Two-stage stochastic hierarchical multiple risk problems: Models and algorithms, A computational study of a solver system for processing two-stage stochastic LPs with enhanced Benders decomposition, Mixed integer nonlinear programming tools: an updated practical overview, Primal partition programming for block diagonal matrices, Robust solution for a min-max regret hub location problem in a fuzzy-stochastic environment, An exact extended formulation for the unrelated parallel machine total weighted completion time problem, Stochastic dual dynamic integer programming, On solving nonsmooth mixed-integer nonlinear programming problems by outer approximation and generalized benders decomposition, On pricing-based equilibrium for network expansion planning. A multi-period bilevel approach under uncertainty, A class of Benders decomposition methods for variational inequalities, A Benders decomposition approach for a real case supply chain network design with capacity acquisition and transporter planning: wheat distribution network, Outer-product-free sets for polynomial optimization and oracle-based cuts, Benders decomposition for the mixed no-idle permutation flowshop scheduling problem, On the \(k\)-strong Roman domination problem, The workload balancing problem at air cargo terminals, A solution approach based on Benders decomposition for the preventive maintenance scheduling problem of a stochastic large-scale energy system, A branch-and-bound method for discretely-constrained mathematical programs with equilibrium constraints, An interior-point Benders based branch-and-cut algorithm for mixed integer programs, On generating maximal nondominated Benders cuts, Interactive polyhedral outer approximation (IPOA) strategy for general multiobjective optimization problems, Speed-up Benders decomposition using maximum density cut (MDC) generation, Strategies for protecting supply chain networks against facility and transportation disruptions: an improved Benders decomposition approach, An improved Benders decomposition algorithm for the logistics facility location problem with capacity expansions, Multicut Benders decomposition algorithm for process supply chain planning under uncertainty, A Benders decomposition approach for an integrated airline schedule design and fleet assignment problem with flight retiming, schedule balance, and demand recapture, Single-facility scheduling by logic-based Benders decomposition, Optimal engineering design via Benders' decomposition, Solution of preemptive multi-objective network design problems applying Benders decomposition method, Estimating the parameters of a fatigue model using Benders' decomposition, A decomposition approach for solving a broadcast domination network design problem, A decomposition approach to the two-stage stochastic unit commitment problem, Solving two-stage robust optimization problems using a column-and-constraint generation method, Decomposition algorithms with parametric Gomory cuts for two-stage stochastic integer programs, Nutmeg: a MIP and CP hybrid solver using branch-and-check, Benders decomposition for a class of variational inequalities, Constraint-based optimization and utility elicitation using the minimax decision criterion, The minimum area spanning tree problem: formulations, Benders decomposition and branch-and-cut algorithms, Scenario-based cuts for structured two-stage stochastic and distributionally robust \(p\)-order conic mixed integer programs, Discrete optimization methods for group model selection in compressed sensing, A loose Benders decomposition algorithm for approximating two-stage mixed-integer recourse models, Biconvex sets and optimization with biconvex functions: a survey and extensions, Risk and resilience-based optimal post-disruption restoration for critical infrastructures under uncertainty, Scheduled service network design with resource management for two-tier multimodal city logistics, Distribution network deployment for omnichannel retailing, RAMP algorithms for the capacitated facility location problem, Optimum synthesis of discrete capacitated networks with multi-terminal commodity flow requirements, Crowdshipping by employees of distribution centers: optimization approaches for matching supply and demand, Using mixed-integer programming to solve power grid blackout problems, Hierarchical decompositions for MPC of resource constrained control systems: applications to building energy management, Portfolio selection with divisible and indivisible assets: mathematical algorithm and economic analysis, Integrating operations and marketing decisions using delayed differentiation of products and guaranteed delivery time under stochastic demand, Algorithm to optimize the quantile criterion for the polyhedral loss function and discrete distribution of random parameters, A structure-conveying modelling language for mathematical and stochastic programming, Scheduling projects with multi-skilled personnel by a hybrid MILP/CP Benders decomposition algorithm, Cost optimization of industrial steel building structures, Benders decomposition, Lagrangean relaxation and metaheuristic design, Resolution method for mixed integer bi-level linear problems based on decomposition technique, Designing a two-echelon distribution network under demand uncertainty, Exact algorithms based on Benders decomposition for multicommodity uncapacitated fixed-charge network design, A robust disaster preparedness model for effective and fair disaster response, A Benders decomposition approach for a distribution network design problem with consolidation and capacity considerations, Optimizing over pure stationary equilibria in consensus stopping games, Accelerated sample average approximation method for two-stage stochastic programming with binary first-stage variables, A new convergent hybrid learning algorithm for two-stage stochastic programs, Partition-based decomposition algorithms for two-stage stochastic integer programs with continuous recourse, A Benders decomposition approach to product location in carousel storage systems, Logic-based Benders decomposition algorithm for contamination detection problem in water networks, A branch-and-Benders-cut approach for the fault tolerant regenerator location problem, New decomposition methods for home care scheduling with predefined visits, Application of Benders decomposition method in solution of a fixed-charge multicommodity network design problem avoiding congestion, Heat and electricity market coordination: a scalable complementarity approach, Formulations and decomposition methods for the incomplete hub location network design problem with and without hop-constraints, DeCODe: a community-based algorithm for generating high-quality decompositions of optimization problems, Coordination mechanisms with mathematical programming models for decentralized decision-making: a literature review, Lagrangian relaxation of the generic materials and operations planning model, On solving two-stage distributionally robust disjunctive programs with a general ambiguity set, Problems related to estimating the coefficients of exact penalty functions, ``Facet separation with one linear program, A decomposition method for MINLPs with Lipschitz continuous nonlinearities, Benders decomposition for the inventory vehicle routing problem with perishable products and environmental costs, Logic-based Benders decomposition for scheduling a batching machine, Application of the preventive maintenance scheduling to increase the equipment reliability: case study- bag filters in cement factory, Symmetry-exploiting cuts for a class of mixed-\(0/1\) second-order cone programs, The stochastic opportunistic replacement problem. II: A two-stage solution approach, An approximate approach for the joint problem of level of repair analysis and spare parts stocking, Large-scale unit commitment under uncertainty, A decomposition approach for the integrated vehicle-crew-roster problem with days-off pattern, A decomposition approach for the general lotsizing and scheduling problem for parallel production lines, Dynamic sequencing and cut consolidation for the parallel hybrid-cut nested L-shaped method, Assessing the effectiveness of \(k\)-shortest path sets in problems of network interdiction, Symmetric duality for disjunctive programming with absolute value functionals, Refining bounds for stochastic linear programs with linearly transformed independent random variables, A combined SDDP/Benders decomposition approach with a risk-averse surface concept for reservoir operation in long term power generation planning, The stochastic opportunistic replacement problem. III: Improved bounding procedures, Multiple allocation hub-and-spoke network design under hub congestion, Local decomposition methods for linear programming, On multistage stochastic integer programming for incorporating logical constraints in asset and liability management under uncertainty, On a mixture of the fix-and-relax coordination and Lagrangian substitution schemes for multistage stochastic mixed integer programming, BFC-MSMIP: an exact branch-and-fix coordination approach for solving multistage stochastic mixed 0-1 problems, On the separability of subproblems in Benders decompositions, A generic stochastic model for supply-and-return network design, A hybrid method for the planning and scheduling, An integrated method for planning and scheduling to minimize tardiness, Analysis of decomposition algorithms with Benders cuts for \(p\)-median problem, A multicut algorithm for two-stage stochastic linear programs, Identifying and exploiting problem structures using explanation-based constraint programming, A Benders decomposition algorithm for base station planning problem in WCDMA networks, An integrated model for logistics network design, An integrated aircraft routing, crew scheduling and flight retiming model, Designing cost-effective content distribution networks, Strong formulations for mixed integer programming: A survey, On a stochastic sequencing and scheduling problem, A branch-and-cut algorithm for the continuous error localization problem in data cleaning, Cutting planes and column generation techniques with the projective algorithm, On the enrouting protocol problem under uncertainty, Integer programming models for the \(q\)-mode problem, Parking buses in a depot using block patterns: a Benders decomposition approach for minimizing type mismatches, On parallelization of a stochastic dynamic programming algorithm for solving large-scale mixed \(0-1\) problems under uncertainty, Experiments in integer programming, A two-stage coupled algorithm for an integrated maintenance planning and flowshop scheduling problem with deteriorating machines, A military maintenance planning and scheduling problem, Two bounds for integrating the virtual dynamic cellular manufacturing problem into supply chain management, Metric selection in fast dual forward-backward splitting, Solving multistage quantified linear optimization problems with the alpha-beta nested Benders decomposition, A note on Benders' decomposition in mixed-integer quadratic programming, Benders' decomposition for the constrained \(\ell_ 1\)-problem, MSLiP: A computer code for the multistage stochastic linear programming problem, On the resemblance between the Kornai-Liptak and cross decomposition techniques for block-angular linear programs, Exact algorithms for the joint object placement and request routing problem in content distribution networks, Exact and heuristic solution approaches for the mixed integer setup knapsack problem, Equilibrium prices supported by dual price functions in markets with non-convexities, Investments in stochastic maximum flow networks, Optimality tests for partitioning and sectional search algorithms, Multi-stage stochastic optimization applied to energy planning, Benders decomposition for the uncapacitated multiple allocation hub location problem, Decomposition in global optimization, Integrated airline scheduling, Computing robust basestock levels, Hedging options under transaction costs and stochastic volatility, The vehicle routing problem: An overview of exact and approximate algorithms, A two-stage stochastic programming model for transportation network protection, Linear mean value cross decomposition: A generalization of the Kornai- Liptak method, A decomposition technique for mixed integer programming problems, A university-timetabling problem and its solution using Benders' partitioning---a case study, Monte Carlo (importance) sampling within a Benders decomposition algorithm for stochastic linear programs, A Benders decomposition method for solving stochastic complementarity problems with an application in energy, An algorithm for stochastic programs with first-order dominance constraints induced by linear recourse, Robust network optimization under polyhedral demand uncertainty is \(NP\)-hard, Allocation and scheduling of conditional task graphs, Towards a practical parallelisation of the simplex method, Adaptive multicut aggregation for two-stage stochastic linear programs with recourse, Stochastic dynamic programming applied to hydrothermal power systems operation planning based on the convex hull algorithm, Integration of strategic and tactical decisions for vendor selection under capacity constraints, IIS branch-and-cut for joint chance-constrained stochastic programs and application to optimal vaccine allocation, The value function of a mixed integer program: I, An algorithm for the quadratic assignment problem using Benders' decomposition, A comparative study of decomposition algorithms for stochastic combinatorial optimization, Practical enhancements to the Magnanti-Wong method, Unilateral contact, elastoplasticity and complementarity with reference to offshore pipeline design, A general algorithm for solving two-stage stochastic mixed \(0-1\) first-stage problems, Enhancements of two-stage stochastic decomposition, A framework for collaborative planning and state-of-the-art, Modeling and optimizing of strategic and tactical production planning in the automotive industry under uncertainty, Using rank-1 lift-and-project closures to generate cuts for 0-1 MIPs, a computational investigation, The mixed postman problem, Theoretical properties and numerical tests of an efficient nonlinear decomposition algorithm, Hedging exotic derivatives through stochastic optimization, Analysis of stochastic problem decomposition algorithms in computational grids, Development of a new approach for deterministic supply chain network design, A robustness approach to uncapacitated network design problems, Cut generation for an integrated employee timetabling and production scheduling problem, Discrete time/cost trade-off problem: a decomposition-based solution algorithm for the budget version, Cut generation for an employee timetabling problem, Improving Benders decomposition using a genetic algorithm, The pickup and delivery problem with transfers: formulation and a branch-and-cut solution method, Bender's method revisited, Large-scale mixed integer programming: Benders-type heuristics, Solving embedded generalized network problems, Constructive characterizations of the value-function of a mixed-integer program. I, Capital budgeting with Benders' decomposition, Constructive characterizations of the value function of a mixed-integer program. II, Die Bedeutung des Operations Research fuer die hierarchische Produktionsplanung, Facility location models for distribution planning, Global optimization algorithms for linearly constrained indefinite quadratic problems, An optimal algorithm for the multiproduct capacitated facility location problem with a choice of facility type, Multi-period near-equilibrium in a pool-based electricity market including on/off decisions, Decomposition branch-and-bound based algorithm for linear programs with additional multiplicative constraints, About Lagrangian methods in integer optimization, Logic-based modeling and solution of nonlinear discrete/continuous optimization problems, Logical processing for integer programming, 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, Hub location problems with price sensitive demands, Projection, consistency, and George Boole, Large-scale optimization with the primal-dual column generation method, A cross-decomposition scheme with integrated primal-dual multi-cuts for two-stage stochastic programming investment planning problems, Decomposition algorithms for two-stage chance-constrained programs, Single-commodity robust network design with finite and hose demand sets, A multicut L-shaped based algorithm to solve a stochastic programming model for the mobile facility routing and scheduling problem, Exact approaches for lifetime maximization in connectivity constrained wireless multi-role sensor networks, An optimization framework for the development of efficient one-way car-sharing systems, Decomposition based hybrid metaheuristics, Feature selection for support vector machines using generalized Benders decomposition, Exact and heuristic algorithms for the design of hub networks with multiple lines, Optimality cuts and a branch-and-cut algorithm for the \(k\)-rooted mini-max spanning forest problem, An integrative cooperative search framework for multi-decision-attribute combinatorial optimization: application to the MDPVRP, A model enhancement heuristic for building robust aircraft maintenance personnel rosters with stochastic constraints, Coordinating decentralized linear programs by exchange of primal information, Optimizing dynamic investment decisions for railway systems protection, Optimal investment plan for dynamic thermal rating using Benders decomposition, Hybrid robust and stochastic optimization for closed-loop supply chain network design using accelerated Benders decomposition, On time stochastic dominance induced by mixed integer-linear recourse in multistage stochastic programs, A new formulation and Benders decomposition for the multi-period maximal covering facility location problem with server uncertainty, Maintenance scheduling in the electricity industry: a literature review, Accelerating Benders decomposition for closed-loop supply chain network design: case of used durable products with different quality levels, Supplier selection in the processed food industry under uncertainty, Benders decomposition without separability: a computational study for capacitated facility location problems, A Benders decomposition-based matheuristic for the cardinality constrained shift design problem, Optimal berth allocation, time-variant quay crane assignment and scheduling with crane setups in container terminals, A branch-and-Benders-cut method for nonlinear power design in green wireless local area networks, Scenario grouping in a progressive hedging-based meta-heuristic for stochastic network design, Recoverable robust single day aircraft maintenance routing problem, A combinatorial Benders' decomposition for the lock scheduling problem, Stage- and scenario-wise Fenchel decomposition for stochastic mixed 0-1 programs with special structure, A decomposition based solution algorithm for U-type assembly line balancing with interval data, Pre-positioning disaster response facilities at safe locations: an evaluation of deterministic and stochastic modeling approaches, Accelerating Benders stochastic decomposition for the optimization under uncertainty of the petroleum product supply chain, Unsplittable non-additive capacitated network design using set functions polyhedra, A two-stage robust optimization approach for the mobile facility fleet sizing and routing problem under uncertainty, A stochastic algorithm for online bipartite resource allocation problems, Interdicting attack graphs to protect organizations from cyber attacks: a bi-level defender-attacker model, An optimal variant of Kelley's cutting-plane method, Multiperiod optimal planning of thermal generation using cross decomposition, A hybrid approach of bundle and Benders applied large mixed linear integer problem, The robust set covering problem with interval data, Strong lift-and-project cutting planes for the stable set problem, A classification of methods for distributed system optimization based on formulation structure, Multistage system planning for hydrogen production and distribution, Stochastic and risk management models and solution algorithm for natural gas transmission network expansion and LNG terminal location planning, Minimizing conditional-value-at-risk for stochastic scheduling problems, Partial-route inequalities for the multi-vehicle routing problem with stochastic demands, A hybrid outer-approximation/Benders decomposition algorithm for the single allocation hub location problem under congestion, Optimal power management of a DISCO with integrations of reliability considerations and wind farm based on Benders decomposition, On 2-stage robust LP with RHS uncertainty: complexity results and applications, Stochastic uncapacitated hub location, Formulations and Benders decomposition algorithms for multidepot salesmen problems with load balancing, Benders, metric and cutset inequalities for multicommodity capacitated network design, Exact and heuristic algorithms for the interval data robust assignment problem, An interior point cutting plane heuristic for mixed integer programming, Adaptive and nonadaptive approaches to statistically based methods for solving stochastic linear programs: a computational investigation, Recourse-based stochastic nonlinear programming: properties and Benders-SQP algorithms, Integrated supply chain planning under uncertainty using an improved stochastic approach, Optimizing system resilience: a facility protection model with recovery time, Stochastic dual dynamic programming applied to nonconvex hydrothermal models, Tree network design avoiding congestion, The analysis of the stability of some integer programming algorithms with respect to the objective function, Strong and compact relaxations in the original space using a compact extended formulation, Column generation for extended formulations, Generalized Benders' decomposition for topology optimization problems, Nonconvex generalized Benders decomposition for stochastic separable mixed-integer nonlinear programs, Almost robust discrete optimization, Augmented Lagrangian method within L-shaped method for stochastic linear programs, Improved combinatorial Benders decomposition for a scheduling problem with unrelated parallel machines, Group preference modeling for intelligent shared environments: social welfare beyond the sum, Benders decomposition for set covering problems. Almost satisfying the consecutive ones property, Detecting large risk-averse 2-clubs in graphs with random edge failures, Contingency-constrained unit commitment with post-contingency corrective recourse, Using central prices in the decomposition of linear programs, Combined branch-and-bound and cutting plane methods for solving a class of nonlinear programming problems, Mixed-integer bilinear programming problems, The integer \(L\)-shaped method for stochastic integer programs with complete recourse, Decomposition in general mathematical programming, Bounding multi-stage stochastic programs from above, Polylithic modeling and solution approaches using algebraic modeling systems, IP over 40+ years at IBM scientific centers and marketing, An integer \(L\)-shaped algorithm for the dial-a-ride problem with stochastic customer delays, Exact approaches for integrated aircraft fleeting and routing at TunisAir, Convergence and application of a decomposition method using duality bounds for nonconvex global optimization, Optimal resource allocation and scheduling for the CELL BE platform, A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery, Stochastic allocation and scheduling for conditional task graphs in multi-processor systems-on-chip, Stochastic set packing problem, An efficient procedure for the N-city traveling salesman problem, A Benders decomposition based heuristic for the hierarchical production planning problem, A branch and bound algorithm for the capacitated vehicle routing problem, Two-stage robust mixed integer programming problem with objective uncertainty, Solving an integrated job-shop problem with human resource constraints, Buffer allocation in stochastic flow lines via sample-based optimization with initial bounds, Parallel processors for planning under uncertainty, On the convergence of cross decomposition, Acceleration strategies of Benders decomposition for the security constraints power system expansion planning, Combining sampling-based and scenario-based nested Benders decomposition methods: application to stochastic dual dynamic programming, Two heuristic methods based on decomposition to the integrated multi-agent supply chain scheduling and distribution problem, A dual-level stochastic fleet size and mix problem for offshore wind farm maintenance operations, A new Lagrangian-Benders approach for a concave cost supply chain network design problem, Implementing Automatic Benders Decomposition in a Modern MIP Solver, A new interior-point approach for large separable convex quadratic two-stage stochastic problems, Stochastic Planning and Scheduling with Logic-Based Benders Decomposition, A Closest Benders Cut Selection Scheme for Accelerating the Benders Decomposition Algorithm, Consistency Cuts for Dantzig-Wolfe Reformulations, LAND USE OPTIMIZATION USING SELF-ORGANIZING ALGORITHMS, Unnamed Item, Deterministic policies based on maximum regrets in MDPs with imprecise rewards, Solving multiple criteria problems by interactive decomposition, AN INTEGER L-SHAPED ALGORITHM FOR TIME-CONSTRAINED TRAVELING SALESMAN PROBLEM WITH STOCHASTIC TRAVEL AND SERVICE TIMES, A convergence proof for linear mean value cross decomposition, Affine recourse for the robust network design problem: Between static and dynamic routing, Benders decomposition approach for the robust network design problem with flow bifurcations, Logic-Based Benders Decomposition and Binary Decision Diagram Based Approaches for Stochastic Distributed Operating Room Scheduling, The Star Degree Centrality Problem: A Decomposition Approach, Solving the Type-2 Assembly Line Balancing with Setups Using Logic-Based Benders Decomposition, Extreme Ray Feasibility Cuts for Unit Commitment with Uncertainty, Novel Formulations and Logic-Based Benders Decomposition for the Integrated Parallel Machine Scheduling and Location Problem, A Scalable Algorithm for Sparse Portfolio Selection, An outer-approximation algorithm for a class of mixed-integer nonlinear programs, Nested decomposition of multistage nonlinear programs with recourse, A Simultaneous Magnanti-Wong Method to Accelerate Benders Decomposition for the Metropolitan Container Transportation Problem, Decomposition Branching for Mixed Integer Programming, Decomposition Algorithms for Two-Stage Distributionally Robust Mixed Binary Programs, Set covering heuristics in a benders decomposition for railway timetabling, A GVNS algorithm applied to the single allocation hub location problem with heterogeneous economies of scale, Vessel Service Planning in Seaports, An Image-Based Approach to Detecting Structural Similarity Among Mixed Integer Programs, A New Scenario Reduction Method Based on Higher-Order Moments, Logic-Based Benders Decomposition for Integrated Process Configuration and Production Planning Problems, Decision Diagrams for Discrete Optimization: A Survey of Recent Advances, On Generating Lagrangian Cuts for Two-Stage Stochastic Integer Programs, A piecewise linear upper bound on the network recourse function, Pickup and Delivery of Partial Loads with “Soft” Time Windows, Résolution des programmes linéaires a variables mixtes par la procédure S.E.P., Collaborative Operating Room Planning and Scheduling, Generalized cross decomposition applied to nonlinear integer programming problems: duality gaps and convexification in parts, Revised dantzig-wolfe decomposition for staircase-structured linear programs, Regularized Decomposition of High-Dimensional Multistage Stochastic Programs with Markov Uncertainty, Tight Second Stage Formulations in Two-Stage Stochastic Mixed Integer Programs, A Privacy-Preserving Method to Optimize Distributed Resource Allocation, Structuring Bilateral Energy Contract Portfolios in Competitive Markets, Break minimization, Unnamed Item, The Benders Dual Decomposition Method, Combining metaheuristics with mathematical programming, constraint programming and machine learning, Optimal price zones of electricity markets: a mixed-integer multilevel model and global solution approaches, Improved penalty calculations for a mixed integer branch-and-bound algorithm, Models and methods of solution of quadratic integer programming problems, A Stochastic Integer Programming Approach to Air Traffic Scheduling and Operations, Accelerating the Benders Decomposition Method: Application to Stochastic Network Design Problems, Inexact Cuts in Stochastic Dual Dynamic Programming Applied to Multistage Stochastic Nondifferentiable Problems, Stochastic Dynamic Linear Programming: A Sequential Sampling Algorithm for Multistage Stochastic Linear Programming, Accelerating benders decomposition with heuristicmaster problem solutions, Integrating operations research in constraint programming, Value management, A Unified Approach to Mixed-Integer Optimization Problems With Logical Constraints, Integrating operations research in constraint programming, Combining metaheuristics with mathematical programming, constraint programming and machine learning, Unnamed Item, Optimal cropping patterns under water deficits., Scenario aggregation for supply chain quantity-flexibility contract, Multistage quadratic stochastic programming, Automatic test data generation for path testing using GAs, Eine allgemeine, symmetrische Formulierung des Dekompositionsprinzips für duale Paare nichtlinearer Minmax- und Maxmin-Probleme, Outer-approximation algorithms for nonsmooth convex MINLP problems, Integrated model for supplier selection and negotiation in a make-to-order environment, Mathematical programming and electricity markets. (With comments and rejoinder), On the interactive solution to a multicriteria scheduling problem, The use of relaxation techniques to solve certain mathematical decision‐making problems, Decomposition of arborescent linear programs, A Modified Benders Method for the Single- and Multiple Allocation P-Hub Median Problems, Challenges in Optimal Control Problems for Gas and Fluid Flow in Networks of Pipes and Canals: From Modeling to Industrial Applications, Augmented Markov Chain Monte Carlo Simulation for Two-Stage Stochastic Programs with Recourse, Preface, Two stage linear programming under uncertainty with 0–1 integer first stage variables, Piecewise convex programs, Unnamed Item, Inexact Cuts in Stochastic Dual Dynamic Programming, Knapsack constraint reformulation: A new approach that significantly reduces the number of sub-problems in the branch and bound algorithm, Projective Cutting-Planes, Flots entiers et multiflots fractionnaires couplés par une contrainte de capacité, Integer programming duality: Price functions and sensitivity analysis, An elementary survey of general duality theory in mathematical programming, High-Performance Prototyping of Decomposition Methods in GAMS, Conflict Analysis for MINLP, A solution procedure for mixed-integer nonlinear programming formulation of supply chain planning with quantity discounts under demand uncertainty, Test problems in stochastic multistage programming, Toward unification of exact and heuristic optimization methods, Cross decomposition for mixed integer programming, Mixed-integer quadratic programming, Parallel implementation of augmented Lagrangian method within L-shaped method for stochastic linear programs, An efficient lagrangean relaxation scheme for linear and integer equal flow problems, Solving partially integer-valued optimization problems which are convex relative to a continuous variable, MPEC Methods for Bilevel Optimization Problems, Beiträge zur Dekomposition von linearen Programmen, Topological design of centralized computer networks—formulations and algorithms, On a bi-level formulation to protect uncapacitated p-median systems with facility recovery time and frequent disruptions, Make to stock and mix to order: choosing intermediate products in the food-processing industry, Exact approaches to the single-source network loading problem, Concave minimization under linear constraints with special structure, Algorithms and Software for Convex Mixed Integer Nonlinear Programs, Weekly self-scheduling, forward contracting, and pool involvement for an electricity producer. An adaptive robust optimization approach, Formation of a strategic manufacturing and distribution network with transfer prices, A decomposition approach to solve a bilevel capacitated facility location problem with equity constraints, Computationally efficient MIP formulation and algorithms for European day-ahead electricity market auctions, Mathematical formulations for a 1-full-truckload pickup-and-delivery problem, Boosting an exact logic-based Benders decomposition approach by variable neighborhood search, A note on the selection of Benders' cuts, A decomposition approach for global optimum search in QP, NLP and MINLP problems, The application of generalized Benders decomposition to certain nonconcave programs, The Minimum Spanning k-Core Problem with Bounded CVaR Under Probabilistic Edge Failures, An integrated plant loading model with economies of scale and scope, Benders Decomposition for Production Routing Under Demand Uncertainty, The method of double truncation in the decomposition of large-scale problems, Heuristic and Exact Algorithms for the Interval Min–Max Regret Knapsack Problem, Robust Investment Management with Uncertainty in Fund Managers’ Asset Allocation, An exact algorithm for solving large-scale two-stage stochastic mixed-integer problems: some theoretical and experimental aspects, A partitioning algorithm for the network loading problem, A hybridization of mathematical programming and dominance-driven enumeration for solving shift-selection and task-sequencing problems, A Constructive Proof of the Representation Theorem for Polyhedral Sets Based on Fundamental Definitions, Simultaneous Location of Trauma Centers and Helicopters for Emergency Medical Service Planning, Combinatorial Benders' Cuts for the Strip Packing Problem, An effective Benders decomposition algorithm for solving the distributed permutation flowshop scheduling problem, Simultaneously exploiting two formulations: an exact Benders decomposition approach, The multi-period multi-trip container drayage problem with release and due dates, A compact reformulation of the two-stage robust resource-constrained project scheduling problem, The electric location-routing problem with heterogeneous fleet: formulation and Benders decomposition approach, Railway disruption management: designing bus bridging services under uncertainty, Benders decomposition for a period-aggregated resource leveling problem with variable job duration, Network scheduling problem with cross-docking and loading constraints, Using 3D-printing in disaster response: the two-stage stochastic 3D-printing knapsack problem, Multiple allocation tree of hubs location problem for non-complete networks, Benders decomposition for network design covering problems, Assembly planning by disjunctive programming and geometrical reasoning, On the mass COVID-19 vaccination scheduling problem, A column generation and combinatorial Benders decomposition algorithm for the selective dial-a-ride-problem, A time-space formulation for the locomotive routing problem at the Canadian National Railways, Designing master surgery schedules with downstream unit integration via stochastic programming, Generalized Benders Decomposition for one Class of MINLPs with Vector Conic Constraint, Exact algorithms for the robust uncapacitated multiple allocation \(p\)-hub median problem, The Relation Between Complete and Incomplete Search, Exact and matheuristic methods for the parallel machine scheduling and location problem with delivery time and due date, Augmented simulation methods for discrete stochastic optimization with recourse, The Robust (Minmax Regret) Quadratic Assignment Problem with Interval Flows, A Partitioning Method that Generates Interpretable Prices for Integer Programming Problems, Integer set reduction for stochastic mixed-integer programming, Des explications pour reconnaître et exploiter les structures cachées d'un problème combinatoire, Logic-Based Benders Decomposition for Large-Scale Optimization, Dynamic-demand capacitated facility location problems with and without relocation, Experiments with primal - dual decomposition and subgradient methods for the uncapacitatied facility location problem, Accelerating Benders method using covering cut bundle generation, Decentralized Cooperative Optimization for Multi-criteria Decision Making, Two-Stage Stochastic Mixed-Integer Programs: Algorithms and Insights, A two-stage stochastic integer programming approach as a mixture of branch-and-fix coordination and Benders decomposition schemes, A fast and accurate technique for mapping parallel applications on stream-oriented MPSoC platforms with communication awareness, A branch-and-check algorithm for minimizing the weighted number of late jobs on a single machine with release dates, An integer decomposition algorithm for solving a two-stage facility location problem with second-stage activation costs, A stochastic programming approach for supply chain network design under uncertainty, A factor \(\frac {1}{2}\) approximation algorithm for two-stage stochastic matching problems, Sequential approach to the solution of mixed linear programs, A nested benders decomposition approach for telecommunication network planning, A constraint generation algorithm for large scale linear programs using multiple-points separation, SPAR: Stochastic Programming with Adversarial Recourse, A method for decomposing mixed-integer linear programs with staircase structure, Solving a class of stochastic mixed-integer programs with branch and price, On solving discrete two-stage stochastic programs having mixed-integer first- and second-stage variables, A Benders decomposition approach for the robust spanning tree problem with interval data, A new approach based on the surrogating method in the project time compression problems, A management system for decompositions in stochastic programming, Simultaneous fleet assignment and cargo routing using Benders decomposition, A Two-Stage Stochastic Integer Programming Approach to Integrated Staffing and Scheduling with Application to Nurse Management, A Structure Conveying Parallelizable Modeling Language for Mathematical Programming, Solving network design problems via iterative aggregation, Decomposition Methods for the Parallel Machine Scheduling Problem with Setups, Robust Critical Node Selection by Benders Decomposition, Decomposition algorithms for solving the minimum weight maximal matching problem, A decomposition method for structured quadratic programming problems, Disjunctive Decomposition for Two-Stage Stochastic Mixed-Binary Programs with Generalized Upper Bound Constraints, Using Logic-Based Benders Decomposition to Solve the Capacity- and Distance-Constrained Plant Location Problem, Convexity and optimization with copulæ structured probabilistic constraints, Branch and Price for Chance-Constrained Bin Packing, A decomposition method for structured linear and nonlinear programs, A Relative Robust Optimization Approach for Full Factorial Scenario Design of Data Uncertainty and Ambiguity, Hierarchical Benders Decomposition for Open-Pit Mine Block Sequencing, Optimization of large-scale systems, Improving the Integer L-Shaped Method, A duality theorem and an algorithm for (mixed-) integer nonlinear programming, Generalized Benders decomposition, On the Finite Optimal Convergence of Logic-Based Benders’ Decomposition in Solving 0–1 Min-Max Regret Optimization Problems with Interval Costs, A mixed integer programming model for scheduling orders in a steel mill, Using profit maximizing scheduling models to structure operational trade-offs and manufacturing strategy issues, Duality in mathematics and linear and integer programming, Cutting plane method for multiple objective stochastic integer linear programming, The \(C^3\) theorem and a \(D^2\) algorithm for large scale stochastic mixed-integer programming: set convexification, Decentralization model with flexible multi-goals and concessions, Addressing supply-side risk in uncertain power markets: stochastic Nash models, scalable algorithms and error analysis, Data parallel computing for network-structured optimization problems, Constraint programming and operations research, Dynamic factorization in large-scale optimization, Utility least cost planning and the Washington gas integrated model, On using approximations of the Benders master problem, Solving the staircase cost facility location problem with decomposition and piecewise linearization, A Benders decomposition-based framework for solving quay crane scheduling problems, A constraint generation scheme to probabilistic linear problems with an application to power system expansion planning, Multi-item capacitated lot-sizing by a cross decomposition based algorithm, New solution approaches for the capacitated supplier selection problem with total quantity discount and activation costs under demand uncertainty, Petroleum refinery optimization, A decomposable self-adaptive projection-based prediction-correction algorithm for convex time space network flow problem, Online spatio-temporal matching in stochastic and dynamic domains, A capacitated hub location problem under hose demand uncertainty, Logic based Benders' decomposition for orthogonal stock cutting problems, Stochastic programming for qualification management of parallel machines in semiconductor manufacturing, A linear programming based heuristic framework for min-max regret combinatorial optimization problems with interval costs, A Benders decomposition based framework for solving cable trench problems, Scenario cluster Lagrangean decomposition for risk averse in multistage stochastic optimization, Benders decomposition applied to a robust multiple allocation incomplete hub location problem, Preemptive rerouting of airline passengers under uncertain delays, Benders decomposition for curriculum-based course timetabling, Branch-and-cut methods for the network design problem with vulnerability constraints, The robust (minmax regret) assembly line worker assignment and balancing problem, Combining Benders decomposition and column generation for multi-activity tour scheduling, A mixed-integer programming approach for locating jamming devices in a flow-jamming attack, Solving a selective dial-a-ride problem with logic-based Benders decomposition, Risk-averse formulations and methods for a virtual power plant, Duality and statistical tests of optimality for two stage stochastic programs, A computational study of exact approaches for the adjustable robust resource-constrained project scheduling problem, Decomposition methods in stochastic programming, From the separation to the intersection sub-problem in Benders decomposition models with prohibitively-many constraints, The design of a reliable and robust hierarchical health service network using an accelerated Benders decomposition algorithm, A node current-based 2-index formulation for the fixed-destination multi-depot travelling salesman problem, A number theoretic reformulation and decomposition method for integer programming, Sequence-dependent time- and cost-oriented assembly line balancing problems: a combinatorial Benders’ decomposition approach, Matheuristics: survey and synthesis, Dynamic reverse supply chain network design under uncertainty: mathematical modeling and solution algorithm, A parallel hub-and-spoke system for large-scale scenario-based optimization under uncertainty, Exact methods for discrete \({\varGamma}\)-robust interdiction problems with an application to the bilevel knapsack problem, A robust optimization model for affine/quadratic flow thinning: A traffic protection mechanism for networks with variable link capacity, Models for the two‐dimensional rectangular single large placement problem with guillotine cuts and constrained pattern, Algorithms for a risk-averse Stackelberg game with multiple adversaries, Logic-based Benders decomposition for wildfire suppression, The bus sightseeing problem, A conflict-directed approach to chance-constrained mixed logical linear programming, Two‐stage stochastic minimum s − t cut problems: Formulations, complexity and decomposition algorithms, Combining optimisation and simulation using logic-based Benders decomposition, A joint demand and supply management approach to large scale urban evacuation planning: evacuate or shelter-in-place, staging and dynamic resource allocation, Application of decomposition techniques in a wildfire suppression optimization model, Multi-period distribution networks with purchase commitment contracts, The stochastic critical node problem over trees, The policy graph decomposition of multistage stochastic programming problems, Capacity reservation for humanitarian relief: a logic-based benders decomposition method with subgradient cut, Risk budgeting portfolios from simulations, Benders' decomposition based exact solution method for multi-manned assembly line balancing problem with walking workers, Solving the integrated bin allocation and collection routing problem for municipal solid waste: a benders decomposition approach, Point-to-point and milk run delivery scheduling: models, complexity results, and algorithms based on Benders decomposition, The two-echelon stochastic multi-period capacitated location-routing problem, First-break-heuristically-schedule: constructing highly-constrained sports timetables, A benders decomposition algorithm for a bid generation problem in the procurement of three-echelon transportation services, Foundations of operations research: from linear programming to data envelopment analysis, A chance-constraint optimization model for a multi-echelon multi-product closed-loop supply chain considering brand diversity: an accelerated Benders decomposition algorithm, A traditional Benders' approach to sports timetabling, The stochastic pseudo-star degree centrality problem, Benders-type branch-and-cut algorithms for capacitated facility location with single-sourcing, Optimizing integrated aircraft assignment and turnaround handling, Robust flows with adaptive mitigation, Sample average approximation for risk-averse problems: a virtual power plant scheduling application, A survey on mixed-integer programming techniques in bilevel optimization, Chance-constrained optimization under limited distributional information: a review of reformulations based on sampling and distributional robustness, Integrating supplier selection decisions into an inventory location problem for designing the supply chain network, A solution algorithm for chance-constrained problems with integer second-stage recourse decisions, A two-stage stochastic variational inequality model for storage and dynamic distribution of medical supplies in epidemic management, Exact and metaheuristic methods for a real-world examination timetabling problem, An efficient method for optimizing nested open pits with operational bottom space, An accelerated benders decomposition algorithm for stochastic power system expansion planning using sample average approximation, A review of decentralized optimization focused on information flows of decomposition algorithms, A new formulation and branch-and-cut method for single-allocation hub location problems, On proximal augmented Lagrangian based decomposition methods for dual block-angular convex composite programming problems, An efficient Benders decomposition for the \(p\)-median problem, Fair-split distribution of multi-dose vaccines with prioritized age groups and dynamic demand: the case study of COVID-19, Distributed decision making----a unified approach., Integrated optimal scheduling and routing of repair crew and relief vehicles after disaster: a novel hybrid solution approach, Fix-and-optimize metaheuristics for minmax regret binary integer programming problems under interval uncertainty, Risk‐averse two‐stage stochastic programming for the inventory rebalancing of bike‐sharing systems, A Decomposition Algorithm for Two-Stage Stochastic Programs with Nonconvex Recourse Functions, A decomposition approach for multidimensional knapsacks with family‐split penalties, A survivable variant of the ring star problem, BFC, A branch-and-fix coordination algorithmic framework for solving some types of stochastic pure and mixed 0--1 programs., Mean value cross decomposition applied to integer programming problems, Intelligent control and optimization under uncertainty with application to hydro power, MIP modelling of changeovers in production planning and scheduling problems, Using an interior point method for the master problem in a decomposition approach, Optimal solution of cellular manufacturing system design: Bender's decomposition approach, Stabilized column generation, Exact solution of multicommodity network optimization problems with general step cost functions, Multi-stage stochastic linear programs for portfolio optimization, On the equivalence between roof duality and Lagrangian duality for unconstrained \(0\)-\(1\) quadratic programming problems, A set covering reformulation of the pure fixed charge transportation problem, Second-order stochastic dominance constrained portfolio optimization: theory and computational tests, Minimum spanning trees with neighborhoods: mathematical programming formulations and solution methods, Benders decomposition and column-and-row generation for solving large-scale linear programs with column-dependent-rows, Single-item dynamic lot-sizing problems: an updated survey, A dynamic discrete network design problem for maintenance planning in traffic networks, Decomposition techniques with mixed integer programming and heuristics for home healthcare planning, A Benders decomposition approach for order acceptance and scheduling problem: a robust optimization approach, A branch-and-Benders-cut algorithm for the crew scheduling and routing problem in road restoration, Carbon-efficient deployment of electric rubber-tyred gantry cranes in container terminals with workload uncertainty, An enhanced L-shaped method for optimizing periodic-review inventory control problems modeled via two-stage stochastic programming, Robust solution for a minimax regret hub location problem in a fuzzy-stochastic environment, Benders decomposition for very large scale partial set covering and maximal covering location problems, The 2-allocation \(p\)-hub median problem and a modified Benders decomposition method for solving hub location problems, Large-scale unit commitment under uncertainty: an updated literature survey, Minimum tiling of a rectangle by squares, Optimal long-term distributed generation planning and reconfiguration of distribution systems: an accelerating Benders' decomposition approach, Formulation and algorithms for the robust maximal covering location problem, A two-stage stochastic programming approach for influence maximization in social networks, Decomposition methods for the two-stage stochastic Steiner tree problem, Integer programming models for mid-term production planning for high-tech low-volume supply chains, Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning, A parallel branch-and-fix coordination based matheuristic algorithm for solving large sized multistage stochastic mixed 0-1 problems, A Benders decomposition approach for solving the offshore wind farm installation planning at the North Sea, Combinatorial Benders cuts for assembly line balancing problems with setups, The Benders decomposition algorithm: a literature review, Stochastic survivable network design problems: theory and practice, A new cross decomposition method for stochastic mixed-integer linear programming, Propagating logic-based Benders' decomposition approaches for distributed operating room scheduling, An analytical approach to the protection planning of a rail intermodal terminal network, Dynamic convexification within nested Benders decomposition using Lagrangian relaxation: an application to the strategic bidding problem, A Benders decomposition-based heuristic for a production and outbound distribution scheduling problem with strict delivery constraints, Multicommodity flows and Benders decomposition for restricted continuous location problems, Revisiting minimum profit conditions in uniform price day-ahead electricity auctions, A generalized Benders decomposition based algorithm for an inventory location problem with stochastic inventory capacity constraints, Service location grouping and pricing in transportation: application in air cargo, Benders decomposition for the Hazmat transport network design problem, Disaggregated Benders decomposition and branch-and-cut for solving the budget-constrained dynamic uncapacitated facility location and network design problem, Multiple allocation hub interdiction and protection problems: model formulations and solution approaches, Optimizing a mineral value chain with market uncertainty using Benders decomposition, Scheduling medical residents' training at university hospitals, A branch-and-cluster coordination scheme for selecting prison facility sites under uncertainty, New linearizations of quadratic assignment problems, Risk-averse two-stage stochastic programming with an application to disaster management, Measuring and maximizing resilience of freight transportation networks, A survey on Benders decomposition applied to fixed-charge network design problems, A computational study of Benders decomposition for the integrated aircraft routing and crew scheduling problem, Mixed integer programming for a special logic constrained optimal control problem, A performance guarantee heuristic for electronic components placement problems including thermal effects, A multi-stage stochastic program for supply chain network redesign problem with price-dependent uncertain demands, Benders decomposition: solving binary master problems by enumeration, Exact solutions for the collaborative pickup and delivery problem, A new formulation and an exact approach for the many-to-many hub location-routing problem, A scalable solution framework for stochastic transmission and generation planning problems

Cites Work