Hybrid branch-and-price-and-cut algorithm for the two-dimensional vector packing problem with time windows (Q6106578): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Multidimensional dual-feasible functions and fast lower bounds for the vector packing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-objective temporal bin packing problem: an application in cloud computing / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Approximate Dynamic Programming Approach to Multidimensional Knapsack Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A single machine scheduling problem with two-dimensional vector packing constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bin packing and related problems: general arc-flow formulation with graph compression / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm 457: finding all cliques of an undirected graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Consistent neighborhood search for one-dimensional bin packing and two-dimensional vector packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds and algorithms for the 2-dimensional vector packing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequencing surgical cases in a day-care environment: an exact branch-and-price approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the problem of reporting maximal cliques / rank
 
Normal rank
Property / cites work
 
Property / cites work: A two-dimensional vector packing model for the efficient use of coil cassettes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition Principle for Linear Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: New exact techniques applied to a class of network flow formulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-price algorithm for the temporal bin packing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bin packing and cutting stock problems: mathematical models and exact algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bin packing with general cost structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for the Bin Packing Problem with Conflicts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Average-weight-controlled bin-oriented heuristics for the one-dimensional bin-packing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimizing routing and delivery patterns with multi-compartment vehicles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resource constrained scheduling as generalized bin packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Routing a mixed fleet of electric and conventional vehicles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stabilized branch-and-price algorithms for vector packing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-price algorithm for the two-dimensional vector packing problem with piecewise linear cost function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for combinatorial problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximation algorithm with absolute worst-case performance ratio 2 for two-dimensional vector packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simulation-based heuristic for the electric vehicle routing problem with time windows and stochastic waiting times at recharging stations / rank
 
Normal rank
Property / cites work
 
Property / cites work: An asymptotic approximation scheme for the concave cost bin packing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the one-dimensional bin packing problem with a weight annealing heuristic / rank
 
Normal rank
Property / cites work
 
Property / cites work: The robust vehicle routing problem with time windows: solution by branch and price and cut / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compact integer linear programming formulations for the temporal bin packing problem with fire-ups / rank
 
Normal rank
Property / cites work
 
Property / cites work: A combinatorial flow-based formulation for temporal bin packing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Set-Covering-Based Heuristic Approach for Bin-Packing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-trip time-dependent vehicle routing problem with time windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generic exact solver for vehicle routing and related problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving bin packing problems using VRPSolver models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation schemes for generalized two-dimensional vector packing with application to data placement / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-bound algorithm for the two-dimensional vector packing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact solution of bin-packing problems using column generation and branch-and-bound / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-price algorithm for the two-dimensional vector packing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Branch-and-Price-and-Cut Algorithm for One-Dimensional Bin-Packing Problems / rank
 
Normal rank

Latest revision as of 13:25, 1 August 2024

scientific article; zbMATH DE number 7705480
Language Label Description Also known as
English
Hybrid branch-and-price-and-cut algorithm for the two-dimensional vector packing problem with time windows
scientific article; zbMATH DE number 7705480

    Statements

    Hybrid branch-and-price-and-cut algorithm for the two-dimensional vector packing problem with time windows (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    3 July 2023
    0 references
    two-dimensional vector packing problem
    0 references
    time windows
    0 references
    hybrid method
    0 references
    branch-and-price-and-cut
    0 references
    adaptive large neighborhood search
    0 references

    Identifiers