Decomposition and dynamic cut generation in integer linear programming (Q2490337): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: VRP / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: DIP / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: CVRPSP / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10107-005-0606-3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1988044254 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polyhedral techniques in combinatorial optimization I: Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3056948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4735941 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A restricted Lagrangean approach to the traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-time separation algorithms for the three-index assignment polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Facets of the three-index assignment polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for the Three-Index Assignment Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The volume algorithm: Producing primal solutions with a subgradient method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Plant location with minimum inventory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branch-and-Price: Column Generation for Solving Huge Integer Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An SST-based algorithm for the steiner problem in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lagrangean heuristics for location problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal rectangular partitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for the set covering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition Principle for Linear Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Truck Dispatching Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Lagrangian Relaxation Method for Solving Integer Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4178782 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Steiner tree polytope and related polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: On constrained optimization by adjoint based quasi-Newton methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: The ellipsoid method and its consequences in combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient cuts in Lagrangean `relax-and-cut' schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lagrangean relaxation. (With comments and rejoinder). / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combining Column Generation and Lagrangian Relaxation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Lagrangian relaxation approach to the edge-weighted clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: 2-Path Cuts for the Vehicle Routing Problem with Time Windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Routing under Capacity and Distance Restrictions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Selected Topics in Column Generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new branch-and-cut algorithm for the capacitated vehicle routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree polytope on 2-trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4265265 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stronger \(K\)-tree relaxations for the vehicle routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Matching Based Exact Algorithm for Capacitated Vehicle Routing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4532225 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040221 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040299 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3372333 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the capacitated vehicle routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time-Indexed Formulations for Machine Scheduling Problems: Column Generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lot-Sizing with Start-Up Times / rank
 
Normal rank

Latest revision as of 13:40, 24 June 2024

scientific article
Language Label Description Also known as
English
Decomposition and dynamic cut generation in integer linear programming
scientific article

    Statements

    Decomposition and dynamic cut generation in integer linear programming (English)
    0 references
    0 references
    0 references
    2 May 2006
    0 references
    0 references
    Integer Programming
    0 references
    Dantzig-Wolfe Decomposition
    0 references
    Lagrangian Relaxation
    0 references
    Branch and Cut
    0 references
    Branch and Price
    0 references
    Decomposition Algorithms
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references