Pages that link to "Item:Q323473"

The following pages link to Bin packing and cutting stock problems: mathematical models and exact algorithms (Q323473):

Displaying 50 items.

• Mathematical programming algorithms for bin packing problems with item fragmentation (Q336982) (← links)
• Bin packing and related problems: general arc-flow formulation with graph compression (Q342316) (← links)
• Stabilized branch-and-price algorithms for vector packing problems (Q724108) (← links)
• An analysis of the integrated lot-sizing and cutting-stock problem formulation (Q821771) (← links)
• Exact solution of bin-packing problems using column generation and branch-and-bound (Q1290171) (← links)
• BISON: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem (Q1362971) (← links)
• Logic based Benders' decomposition for orthogonal stock cutting problems (Q1652086) (← links)
• The skiving stock problem and its relation to hypergraph matchings (Q1662646) (← links)
• Two-dimensional cutting stock problem with sequence dependent setup times (Q1681356) (← links)
• Enhanced arc-flow formulations to minimize weighted completion time on identical parallel machines (Q1711446) (← links)
• Combinatorial investigations on the maximum gap for skiving stock instances of the divisible case (Q1730578) (← links)
• An empirical analysis of exact algorithms for the unbounded knapsack problem (Q1735169) (← links)
• Mathematical models for stable matching problems with ties and incomplete lists (Q1737478) (← links)
• BPPLIB: a library for bin packing and cutting stock problems (Q1746064) (← links)
• Iterative aggregation and disaggregation algorithm for pseudo-polynomial network flow models with side constraints (Q1751662) (← links)
• Colocating tasks in data centers using a side-effects performance model (Q1754339) (← links)
• Mathematical models and decomposition methods for the multiple knapsack problem (Q1755383) (← links)
• LP models for bin packing and cutting stock problems (Q1847189) (← links)
• A heuristic for the problem of one-dimensional steel coil cutting (Q1983859) (← links)
• Minimizing the number of machines with limited workload capacity for scheduling jobs with interval constraints (Q1985052) (← links)
• Cutting stock problems with nondeterministic item lengths: a new approach to server consolidation (Q2001201) (← links)
• Optimization in Sanger sequencing (Q2003583) (← links)
• An upper bound of \(\Delta(E) < 3 \slash 2\) for skiving stock instances of the divisible case (Q2012070) (← links)
• New symmetry-less ILP formulation for the classical one dimensional bin-packing problem (Q2019488) (← links)
• Bin packing problem with conflicts and item fragmentation (Q2026980) (← links)
• Exact solution techniques for two-dimensional cutting and packing (Q2029021) (← links)
• Mathematical formulations for scheduling jobs on identical parallel machines with family setup times and total weighted completion time minimization (Q2029254) (← links)
• A metaheuristic algorithm and structured analysis for the Line-haul Feeder vehicle routing problem with time windows (Q2033323) (← links)
• Solving bin packing problems using VRPSolver models (Q2033390) (← links)
• A hybrid evolutionary algorithm for the offline Bin Packing Problem (Q2045610) (← links)
• Solving robust bin-packing problems with a branch-and-price approach (Q2060393) (← links)
• New exact techniques applied to a class of network flow formulations (Q2061874) (← links)
• Variable and constraint reduction techniques for the temporal bin packing problem with fire-ups (Q2080827) (← links)
• Packing-based branch-and-bound for discrete malleable task scheduling (Q2093190) (← links)
• Generalized relax-and-fix heuristic (Q2108128) (← links)
• On the exact separation of cover inequalities of maximum-depth (Q2115307) (← links)
• A residual recombination heuristic for one-dimensional cutting stock problems (Q2121621) (← links)
• An introduction to stochastic bin packing-based server consolidation with conflicts (Q2146367) (← links)
• Knapsack problems -- an overview of recent advances. I: Single knapsack problems (Q2147010) (← links)
• Integrated bin packing and lot-sizing problem considering the configuration-dependent bin packing process (Q2158010) (← links)
• Scheduling a single parallel-batching machine with non-identical job sizes and incompatible job families (Q2158015) (← links)
• Two-dimensional skiving and cutting stock problem with setup cost based on column-and-row generation (Q2184147) (← links)
• A generic exact solver for vehicle routing and related problems (Q2196312) (← links)
• An exact model for a slitting problem in the steel industry (Q2239876) (← links)
• Arc flow formulations based on dynamic programming: theoretical foundations and applications (Q2239929) (← links)
• An extended goal programming model for the multiobjective integrated lot-sizing and cutting stock problem (Q2242390) (← links)
• Random sampling and machine learning to understand good decompositions (Q2288981) (← links)
• A lexicographic pricer for the fractional bin packing problem (Q2294394) (← links)
• Scheduling with uncertain processing times in mixed-criticality systems (Q2315625) (← links)
• A branch-and-price algorithm for the two-dimensional vector packing problem (Q2329474) (← links)