scientific article; zbMATH DE number 2084694
From MaRDI portal
Publication:4475618
Recommendations
Cited in
(63)- Cutting plane algorithms for solving a stochastic edge-partition problem
- A new approach to integrating mixed integer programming and constraint logic programming
- Constraint programming and operations research
- An exact optimization approach for an integrated process configuration, lot-sizing, and scheduling problem
- A branch-and-check approach for a wind turbine maintenance scheduling problem
- Logic based Benders' decomposition for orthogonal stock cutting problems
- A matheuristic based on large neighborhood search for the vehicle routing problem with cross-docking
- Solving a selective dial-a-ride problem with logic-based Benders decomposition
- The Benders decomposition algorithm: a literature review
- Propagating logic-based Benders' decomposition approaches for distributed operating room scheduling
- Implementing the branch-and-cut approach for a general purpose Benders' decomposition framework
- Solving integrated operating room planning and scheduling: logic-based Benders decomposition versus branch-price-and-cut
- The multiphase course timetabling problem
- Pump scheduling in drinking water distribution networks with an LP/NLP-based branch and bound
- New formulations and solution approaches for the latency location routing problem
- Branch-relax-and-check: a tractable decomposition method for order acceptance and identical parallel machine scheduling
- Nutmeg: a MIP and CP hybrid solver using branch-and-check
- Scheduling projects with multi-skilled personnel by a hybrid MILP/CP Benders decomposition algorithm
- A branch-and-price-and-check model for the vehicle routing problem with location congestion
- Single-facility scheduling by logic-based Benders decomposition
- 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
- Detecting infeasibility and generating cuts for mixed integer programming using constraint programming
- Branch-and-check approaches for the tourist trip design problem with rich constraints
- A column generation and combinatorial Benders decomposition algorithm for the selective dial-a-ride-problem
- Decomposition methods for the parallel machine scheduling problem with setups
- Coloring graphs using two colors while avoiding monochromatic cycles
- Benders decomposition and an IP-based heuristic for selecting IMRT treatment beam angles
- Supplier selection in the processed food industry under uncertainty
- A branch-and-Benders-cut method for nonlinear power design in green wireless local area networks
- Logic-based Benders decomposition for large-scale optimization
- Branch and Infer: A Unifying Framework for Integer and Finite Domain Constraint Programming
- scientific article; zbMATH DE number 2084693 (Why is no real title available?)
- scientific article; zbMATH DE number 2159466 (Why is no real title available?)
- Ahybrid model (MILP-CLP) to pipeline operational scheduling
- scientific article; zbMATH DE number 1406243 (Why is no real title available?)
- Stochastic planning and scheduling with logic-based Benders decomposition
- Team Orienteering with Time-Varying Profit
- Models and Algorithms for the Bin-Packing Problem with Minimum Color Fragmentation
- Logic-Based Benders Decomposition for Integrated Process Configuration and Production Planning Problems
- A Search-Infer-and-Relax Framework for Integrating Solution Methods
- Logic-based Benders decomposition for wildfire suppression
- Computational evaluation of cut-strengthening techniques in logic-based Benders' decomposition
- Combining optimisation and simulation using logic-based Benders decomposition
- Point-to-point and milk run delivery scheduling: models, complexity results, and algorithms based on Benders decomposition
- Multi-depot electric vehicle scheduling in in-plant production logistics considering non-linear charging models
- An accelerated benders decomposition algorithm for the solution of the multi-trip time-dependent vehicle routing problem with time windows
- Capacitated vehicle routing problem with a zone tariff
- On the periodic service scheduling problem with non-uniform demands
- Minimizing the maximum flow loss in the network maintenance scheduling problem with flexible arc outages
- Flow-shop and job-shop robust scheduling problems with budgeted uncertainty
- Logic-based benders decomposition methods for the distributed permutation flow shop scheduling problem with production and transportation cost
- One Benders cut to rule all schedules in the neighbourhood
- Multiskilled workforce staffing and scheduling: a logic-based Benders' decomposition approach
- A two-echelon multi-trip vehicle routing problem with synchronization for an integrated water- and land-based transportation system
- Mixed-model sequencing with stochastic failures: a case study for automobile industry
- The rail-road dial-a-ride problem
- Stochastic allocation and scheduling for conditional task graphs in multi-processor systems-on-chip
- Recent developments in location-routing problems. Deterministic single-echelon, single-objective, single-period problems
- Branch-and-repair for the stochastic three-dimensional bin selection problem: a multi-stage stochastic programming application
- A hybrid method for the planning and scheduling
- An integrated method for planning and scheduling to minimize tardiness
- Scheduling and routing of automated guided vehicles: A hybrid approach
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4475618)
