Pages that link to "Item:Q3392098"

The following pages link to Planning and Scheduling by Logic-Based Benders Decomposition (Q3392098):

Displaying 50 items.

• Projection, consistency, and George Boole (Q265702) (← links)
• Decomposition based hybrid metaheuristics (Q319285) (← links)
• Analysis of a parallel machine scheduling problem with sequence dependent setup times and job availability intervals (Q322736) (← links)
• The stop-and-drop problem in nonprofit food distribution networks (Q478060) (← links)
• A bilevel decomposition algorithm for simultaneous production scheduling and conflict-free routing for automated guided vehicles (Q614066) (← links)
• Improved combinatorial Benders decomposition for a scheduling problem with unrelated parallel machines (Q670464) (← links)
• SCIP: solving constraint integer programs (Q734351) (← links)
• Solving an integrated job-shop problem with human resource constraints (Q744642) (← links)
• A hybrid method for the planning and scheduling (Q850451) (← links)
• An integrated method for planning and scheduling to minimize tardiness (Q850465) (← 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)
• Cut generation for an integrated employee timetabling and production scheduling problem (Q1037686) (← links)
• Cutting plane algorithms for solving a stochastic edge-partition problem (Q1040087) (← links)
• Constraint programming and operations research (Q1616390) (← links)
• IBM ILOG CP optimizer for scheduling. 20+ years of scheduling with constraints at IBM/ILOG (Q1616392) (← links)
• A Benders decomposition-based framework for solving quay crane scheduling problems (Q1622801) (← links)
• An exact optimization approach for an integrated process configuration, lot-sizing, and scheduling problem (Q1634095) (← links)
• Logic based Benders' decomposition for orthogonal stock cutting problems (Q1652086) (← links)
• Solving a selective dial-a-ride problem with logic-based Benders decomposition (Q1652651) (← links)
• Recursive logic-based Benders' decomposition for multi-mode outpatient scheduling (Q1751262) (← links)
• The Benders decomposition algorithm: a literature review (Q1751891) (← links)
• Propagating logic-based Benders' decomposition approaches for distributed operating room scheduling (Q1752822) (← links)
• Changeover formulations for discrete-time mixed-integer programming scheduling models (Q1753514) (← links)
• \(N\)-level modulo-based CNF encodings of pseudo-Boolean constraints for MaxSAT (Q2009185) (← links)
• Upper and lower bounds for the permutation flowshop scheduling problem with minimal time lags (Q2018863) (← links)
• A combinatorial Benders decomposition algorithm for parallel machine scheduling with working-time restrictions (Q2029954) (← links)
• An exact algorithm for the unidirectional quay crane scheduling problem with vessel stability (Q2029972) (← links)
• Solving integrated operating room planning and scheduling: logic-based Benders decomposition versus branch-price-and-cut (Q2030502) (← links)
• Logic-based Benders decomposition method for the \textit{seru} scheduling problem with sequence-dependent setup time and DeJong's learning effect (Q2060398) (← links)
• Exact optimization and decomposition approaches for shelf space allocation (Q2077910) (← links)
• Order assignment and scheduling under processing and distribution time uncertainty (Q2083940) (← links)
• Strengthening of feasibility cuts in logic-based benders decomposition (Q2117199) (← links)
• Logic-based benders decomposition for an inter-modal transportation problem (Q2117232) (← links)
• Type-2 integrated process-planning and scheduling problem: reformulation and solution algorithms (Q2146989) (← links)
• A logic-based Benders decomposition method for the multi-trip traveling repairman problem with drones (Q2147137) (← links)
• New solution procedures for the order picker routing problem in U-shaped Pick areas with a movable depot (Q2152010) (← links)
• A logic-based Benders decomposition for microscopic railway timetable planning (Q2158004) (← links)
• Branch-relax-and-check: a tractable decomposition method for order acceptance and identical parallel machine scheduling (Q2189876) (← links)
• Integrated integer programming and decision diagram search tree with an application to the maximum independent set problem (Q2195980) (← links)
• A Benders decomposition approach for a real case supply chain network design with capacity acquisition and transporter planning: wheat distribution network (Q2196095) (← links)
• Nutmeg: a MIP and CP hybrid solver using branch-and-check (Q2226478) (← links)
• Crowdshipping by employees of distribution centers: optimization approaches for matching supply and demand (Q2242299) (← links)
• A robust disaster preparedness model for effective and fair disaster response (Q2273905) (← links)
• Logic-based Benders decomposition algorithm for contamination detection problem in water networks (Q2289916) (← links)
• Benders decomposition for the inventory vehicle routing problem with perishable products and environmental costs (Q2333123) (← links)
• Logic-based Benders decomposition for scheduling a batching machine (Q2333133) (← links)
• Petroleum supply planning: reformulations and a novel decomposition algorithm (Q2358145) (← links)
• On solving nonsmooth mixed-integer nonlinear programming problems by outer approximation and generalized benders decomposition (Q2420817) (← links)
• Single-facility scheduling by logic-based Benders decomposition (Q2442086) (← links)