Logic-based Benders decomposition
From MaRDI portal
Publication:1396822
DOI10.1007/s10107-003-0375-9zbMath1023.90082OpenAlexW1508945008MaRDI QIDQ1396822
Greger Ottosson, John N. Hooker
Publication date: 13 July 2003
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://figshare.com/articles/journal_contribution/Logic-Based_Benders_Decomposition/6706649
Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Boolean programming (90C09) Decomposition methods (49M27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Extreme-point and pivoting methods (90C49)
Related Items (only showing first 100 items - show all)
Petroleum supply planning: reformulations and a novel decomposition algorithm ⋮ Projection, consistency, and George Boole ⋮ Constraint programming and operations research ⋮ A Benders decomposition-based framework for solving quay crane scheduling problems ⋮ Weekly self-scheduling, forward contracting, and pool involvement for an electricity producer. An adaptive robust optimization approach ⋮ Inexact stabilized Benders' decomposition approaches with application to chance-constrained problems with finite support ⋮ An exact optimization approach for an integrated process configuration, lot-sizing, and scheduling problem ⋮ Boosting an exact logic-based Benders decomposition approach by variable neighborhood search ⋮ On convex quadratic programs with linear complementarity constraints ⋮ On the separability of subproblems in Benders decompositions ⋮ Decomposition based hybrid metaheuristics ⋮ Type-2 integrated process-planning and scheduling problem: reformulation and solution algorithms ⋮ Exact method to optimize the total electricity cost in two-machine permutation flow shop scheduling problem under time-of-use tariff ⋮ Branch-and-cut-and-price for the electric vehicle routing problem with time windows, piecewise-linear recharging and capacitated recharging stations ⋮ A granular local search matheuristic for a heterogeneous fleet vehicle routing problem with stochastic travel times ⋮ A hybrid method for the planning and scheduling ⋮ An integrated method for planning and scheduling to minimize tardiness ⋮ A branch-and-Benders-cut method for nonlinear power design in green wireless local area networks ⋮ Analysis of decomposition algorithms with Benders cuts for \(p\)-median problem ⋮ A Benders approach for the constrained minimum break problem ⋮ A combinatorial Benders' decomposition for the lock scheduling problem ⋮ A branch-and-check approach for a wind turbine maintenance scheduling problem ⋮ Identifying and exploiting problem structures using explanation-based constraint programming ⋮ Scheduling and routing of automated guided vehicles: A hybrid approach ⋮ Logic based Benders' decomposition for orthogonal stock cutting problems ⋮ A linear programming based heuristic framework for min-max regret combinatorial optimization problems with interval costs ⋮ Combining Benders decomposition and column generation for multi-activity tour scheduling ⋮ Solving a selective dial-a-ride problem with logic-based Benders decomposition ⋮ A logic-based Benders decomposition for microscopic railway timetable planning ⋮ Robust min-max regret covering problems ⋮ Optimizing rest times and differences in games played: an iterative two-phase approach ⋮ Solving a large-scale precedence constrained scheduling problem with elastic jobs using tabu search ⋮ A hybridization of mathematical programming and dominance-driven enumeration for solving shift-selection and task-sequencing problems ⋮ Shattering inequalities for learning optimal decision trees ⋮ The multi-period multi-trip container drayage problem with release and due dates ⋮ Network scheduling problem with cross-docking and loading constraints ⋮ Using 3D-printing in disaster response: the two-stage stochastic 3D-printing knapsack problem ⋮ 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 bilevel decomposition algorithm for simultaneous production scheduling and conflict-free routing for automated guided vehicles ⋮ Logic-based benders decomposition with a partial assignment acceleration technique for avionics scheduling ⋮ Exact and matheuristic methods for the parallel machine scheduling and location problem with delivery time and due date ⋮ Unrelated parallel machine scheduling problem with special controllable processing times and setups ⋮ A two-stage coupled algorithm for an integrated maintenance planning and flowshop scheduling problem with deteriorating machines ⋮ On solving nonsmooth mixed-integer nonlinear programming problems by outer approximation and generalized benders decomposition ⋮ Branch-relax-and-check: a tractable decomposition method for order acceptance and identical parallel machine scheduling ⋮ Achieving consistency with cutting planes ⋮ An LPCC approach to nonconvex quadratic programs ⋮ Single-facility scheduling by logic-based Benders decomposition ⋮ A decomposition approach for solving a broadcast domination network design problem ⋮ Constraint programming approach to a bilevel scheduling problem ⋮ Mixed logical-linear programming ⋮ The stop-and-drop problem in nonprofit food distribution networks ⋮ Nutmeg: a MIP and CP hybrid solver using branch-and-check ⋮ Scheduling a triple round robin tournament for the best Danish soccer league ⋮ A worker constrained flexible job shop scheduling problem with sequence-dependent setup times ⋮ Almost robust discrete optimization ⋮ Improved combinatorial Benders decomposition for a scheduling problem with unrelated parallel machines ⋮ A branch-and-price algorithm for a vehicle routing with demand allocation problem ⋮ Recursive logic-based Benders' decomposition for multi-mode outpatient scheduling ⋮ The Benders decomposition algorithm: a literature review ⋮ Propagating logic-based Benders' decomposition approaches for distributed operating room scheduling ⋮ Integrating operations and marketing decisions using delayed differentiation of products and guaranteed delivery time under stochastic demand ⋮ A fast and accurate technique for mapping parallel applications on stream-oriented MPSoC platforms with communication awareness ⋮ Joint optimization of product family configuration and scaling design by Stackelberg game ⋮ A branch-and-check algorithm for minimizing the weighted number of late jobs on a single machine with release dates ⋮ Local search and constraint programming for the post enrolment-based course timetabling problem ⋮ A cutting plane approach for integrated planning and scheduling ⋮ Allocation and scheduling of conditional task graphs ⋮ Optimal resource allocation and scheduling for the CELL BE platform ⋮ Stochastic allocation and scheduling for conditional task graphs in multi-processor systems-on-chip ⋮ Upper and lower bounds for the permutation flowshop scheduling problem with minimal time lags ⋮ A robust disaster preparedness model for effective and fair disaster response ⋮ Accelerating Benders decomposition for short-term hydropower maintenance scheduling ⋮ Exact solution techniques for two-dimensional cutting and packing ⋮ The multiple multidimensional knapsack with family-split penalties ⋮ Multi-warehouse package consolidation for split orders in online retailing ⋮ Orbital shrinking: theory and applications ⋮ An exact algorithm for the unidirectional quay crane scheduling problem with vessel stability ⋮ Solving integrated operating room planning and scheduling: logic-based Benders decomposition versus branch-price-and-cut ⋮ Regularized decomposition of large scale block-structured robust optimization problems ⋮ Two-level decomposition algorithm for crew rostering problems with fair working condition ⋮ Logic-based Benders decomposition algorithm for contamination detection problem in water networks ⋮ New decomposition methods for home care scheduling with predefined visits ⋮ Solving network design problems via iterative aggregation ⋮ Decomposition Methods for the Parallel Machine Scheduling Problem with Setups ⋮ Solving an integrated job-shop problem with human resource constraints ⋮ Using Logic-Based Benders Decomposition to Solve the Capacity- and Distance-Constrained Plant Location Problem ⋮ A Benders approach for computing lower bounds for the mirrored traveling tournament problem ⋮ Logic-based Benders decomposition method for the \textit{seru} scheduling problem with sequence-dependent setup time and DeJong's learning effect ⋮ Cutting plane algorithms for solving a stochastic edge-partition problem ⋮ Exact optimization and decomposition approaches for shelf space allocation ⋮ Order assignment and scheduling under processing and distribution time uncertainty ⋮ An enhanced logical benders approach for linear programs with complementarity constraints ⋮ An exact projection-based algorithm for bilevel mixed-integer problems with nonlinearities ⋮ A framework for generalized Benders' decomposition and its application to multilevel optimization ⋮ The multiphase course timetabling problem ⋮ Strengthening of feasibility cuts in logic-based benders decomposition ⋮ Logic-based benders decomposition for an inter-modal transportation problem
This page was built for publication: Logic-based Benders decomposition
