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.

• Improved flow-based formulations for the skiving stock problem (Q2333124) (← links)
• A branch-and-price algorithm for the temporal bin packing problem (Q2337386) (← links)
• A study on load-balanced variants of the bin packing problem (Q2422735) (← links)
• Novel formulations and modeling enhancements for the dynamic berth allocation problem (Q2424775) (← links)
• A note on ``Reducing the number of binary variables in cutting stock problems'' (Q2448139) (← links)
• Branch-and-price algorithms for the dual bin packing and maximum cardinality bin packing problem (Q2572248) (← links)
• A note on the approximability of cutting stock problems (Q2643962) (← links)
• Multi-objective temporal bin packing problem: an application in cloud computing (Q2664301) (← links)
• Scheduling jobs with release dates on identical parallel machines by minimizing the total weighted completion time (Q2664351) (← links)
• A Bayesian Monte Carlo method for computing the Shapley value: application to weighted voting and bin packing games (Q2664449) (← links)
• Compact integer linear programming formulations for the temporal bin packing problem with fire-ups (Q2668727) (← links)
• An exact framework for the discrete parallel machine scheduling location problem (Q2668759) (← links)
• Single batch machine scheduling with dual setup times for autoclave molding manufacturing (Q2668803) (← links)
• Arc-flow approach for single batch-processing machine scheduling (Q2669497) (← links)
• Mathematical models and approximate solution approaches for the stochastic bin packing problem (Q2669539) (← links)
• Capping methods for the automatic configuration of optimization algorithms (Q2669790) (← links)
• Exact solution of network flow models with strong relaxations (Q2689828) (← links)
• Exact solution of the two-dimensional finite bin packing problem (Q2783932) (← links)
• Prospective network flow models and algorithms for bin packing problems (Q2883549) (← links)
• A polynomial time OPT + 1 algorithm for the cutting stock problem with a constant number of object lengths (Q2884299) (← links)
• An inexact bundle approach to cutting-stock problems (Q2899044) (← links)
• A New Branch-and-Price-and-Cut Algorithm for One-Dimensional Bin-Packing Problems (Q3386775) (← links)
• Mathematical Models and Search Algorithms for the Capacitated <i>p</i>-Center Problem (Q3386776) (← links)
• The Bin‐Packing Problem: A Problem Generator and Some Numerical Experiments with FFD Packing and MTP (Q3842995) (← links)
• Characterizing IRDP-instances of the skiving stock problem by means of polyhedral theory (Q4646531) (← links)
• Sensitive Instances of the Cutting Stock Problem (Q4965102) (← links)
• A Posteriori Analysis of the Algorithms for Two-Bar Charts Packing Problem (Q5054168) (← links)
• Combinatorial Benders Decomposition for the Two-Dimensional Bin Packing Problem (Q5085469) (← links)
• Stabilized Column Generation Via the Dynamic Separation of Aggregated Rows (Q5086013) (← links)
• Casting Light on the Hidden Bilevel Combinatorial Structure of the Capacitated Vertex Separator Problem (Q5106375) (← links)
• Bin Packing Problem with Time Lags (Q5106420) (← links)
• The Meet-in-the-Middle Principle for Cutting and Packing Problems (Q5137950) (← links)
• Primal Heuristics for Branch and Price: The Assets of Diving Methods (Q5138257) (← links)
• Enhanced Pseudo-polynomial Formulations for Bin Packing and Cutting Stock Problems (Q5139850) (← links)
• (Q5152214) (← links)
• Analysis of the simple assembly line balancing problem complexity (Q6047869) (← links)
• Lexicographic optimization for the multi-container loading problem with open dimensions for a shoe manufacturer (Q6054017) (← links)
• An introduction to the two‐dimensional rectangular cutting and packing problem (Q6056889) (← links)
• An iterated greedy algorithm for the planning of yarn‐dyeing boilers (Q6060692) (← links)
• Same‐day deliveries in omnichannel retail: Integrated order picking and vehicle routing with vehicle‐site dependencies (Q6076887) (← links)
• A Faster Exponential Time Algorithm for Bin Packing With a Constant Number of Bins via Additive Combinatorics (Q6089980) (← links)
• A mixed‐integer linear model for the multiple heterogeneous knapsack problem with realistic container loading constraints and bins' priority (Q6092554) (← links)
• Mathematical models for the two-dimensional variable-sized cutting stock problem in the home textile industry (Q6106482) (← links)
• Hybrid branch-and-price-and-cut algorithm for the two-dimensional vector packing problem with time windows (Q6106578) (← links)
• The transportation problem with packing constraints (Q6106585) (← links)
• One-dimensional stock cutting resilient against singular random defects (Q6106587) (← links)
• A multi-start local search heuristic for the multi-period auto-carrier loading and transportation problem in Brazil (Q6106977) (← links)
• A combinatorial flow-based formulation for temporal bin packing problems (Q6109803) (← links)
• Exact and heuristic methods for a workload allocation problem with chain precedence constraints (Q6112777) (← links)
• A 4/3 OPT+2/3 approximation for big two-bar charts packing problem (Q6147752) (← links)