Pages that link to "Item:Q3116760"

The following pages link to bc — prod: A Specialized Branch-and-Cut System for Lot-Sizing Problems (Q3116760):

Displaying 50 items.

• A Lagrangian relaxation-based method and models evaluation for multi-level lot sizing problems with backorders (Q336386) (← links)
• Heuristics for the multi-item capacitated lot-sizing problem with lost sales (Q339577) (← links)
• A hybrid adaptive large neighborhood search heuristic for lot-sizing with setup times (Q439552) (← links)
• Reformulation and a Lagrangian heuristic for lot sizing problem on parallel machines (Q490153) (← links)
• A relax-and-fix with fix-and-optimize heuristic applied to multi-level lot-sizing problems (Q525062) (← links)
• Stochastic lot-sizing with backlogging: computational complexity analysis (Q537961) (← links)
• On the equivalence of strong formulations for capacitated multi-level lot sizing problems with setup times (Q695342) (← links)
• Cutting planes in integer and mixed integer programming (Q697578) (← links)
• Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches (Q857326) (← links)
• Capacitated lot-sizing with extensions: a review (Q926571) (← links)
• A heuristic approach for big bucket multi-level production planning problems (Q958084) (← links)
• Polyhedral analysis for the two-item uncapacitated lot-sizing problem with one-way substitution (Q967369) (← links)
• Solving uncapacitated multilevel lot-sizing problems using a particle swarm optimization with flexible inertial weight (Q971702) (← links)
• A primal-dual algorithm for the economic lot-sizing problem with multi-mode replenishment (Q1011268) (← links)
• Efficient and effective heuristics for the coordinated capacitated lot-size problem (Q1046059) (← links)
• Improved lower bounds for the capacitated lot sizing problem with setup times. (Q1417600) (← links)
• Heuristic genetic algorithms for general capacitated lot-sizing problems (Q1609180) (← links)
• The green capacitated multi-item lot sizing problem with parallel machines (Q1651651) (← links)
• Partial objective inequalities for the multi-item capacitated lot-sizing problem (Q1652548) (← links)
• The dynamic bowser routing problem (Q1711454) (← links)
• Distance and matching-induced search algorithm for the multi-level lot-sizing problem with substitutable bill of materials (Q1737490) (← links)
• Valid inequalities for two-period relaxations of big-bucket lot-sizing problems: zero setup case (Q1754210) (← links)
• An efficient matheuristic for offline patient-to-bed assignment problems (Q1754343) (← links)
• An MIP-based interval heuristic for the capacitated multi-level lot-sizing problem with setup times (Q1761844) (← links)
• Scheduling injection molding operations with multiple resource constraints and sequence dependent setup times and costs (Q1781573) (← links)
• Workforce planning in a lotsizing mail processing problem (Q1781576) (← links)
• A computational analysis of lower bounds for big bucket production planning problems (Q1935570) (← links)
• Perspectives on integer programming for time-dependent models (Q2001858) (← links)
• A supervised learning-driven heuristic for solving the facility location and production planning problem (Q2140228) (← links)
• A math-heuristic Dantzig-Wolfe algorithm for capacitated lot sizing (Q2248555) (← links)
• Worst case analysis of relax and fix heuristics for lot-sizing problems (Q2312339) (← links)
• Dynamic capacitated lot-sizing problems: a classification and review of solution approaches (Q2379665) (← links)
• Mixed integer programming in production planning with backlogging and setup carryover: modeling and algorithms (Q2393142) (← links)
• Mathematical programming based heuristics for the 0--1 MIP: a survey (Q2401328) (← links)
• The profit maximizing capacitated lot-size (PCLSP) problem (Q2432891) (← links)
• A Lagrangian-based heuristic for the capacitated lot-sizing problem in parallel machines (Q2433465) (← links)
• Manufacturer's mixed pallet design problem (Q2462174) (← links)
• The multi-item capacitated lot-sizing problem with setup times and shortage costs (Q2464221) (← links)
• Single item lot sizing problems (Q2566041) (← links)
• Approximate extended formulations (Q2583138) (← links)
• A bucket indexed formulation for nonpreemptive single machine scheduling problems (Q2806861) (← links)
• A horizon decomposition approach for the capacitated lot-sizing problem with setup times (Q2830951) (← links)
• Local Cuts and Two-Period Convex Hull Closures for Big-Bucket Lot-Sizing Problems (Q2960369) (← links)
• LS-LIB: A Library of Tools for Solving Production Planning Problems (Q2971615) (← links)
• Period Decompositions for the Capacitated Lot Sizing Problem with Setup Times (Q3458742) (← links)
• A Polynomial Time Algorithm for the Stochastic Uncapacitated Lot-Sizing Problem with Backlogging (Q3503865) (← links)
• MIP-based heuristics for multi-item capacitated lot-sizing problem with setup times and shortage costs (Q3598683) (← links)
• Tactical Production and Lot Size Planning with Lifetime Constraints: A Comparison of Model Formulations (Q4595321) (← links)
• Predictive Search for Capacitated Multi-Item Lot Sizing Problems (Q5084658) (← links)
• Analytics Branching and Selection for the Capacitated Multi-Item Lot Sizing Problem with Nonidentical Machines (Q5131723) (← links)