Column Generation
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Solving the electricity production planning problem by a column generation based heuristic
- Linear edge costs and labeling algorithms: The case of the time‐dependent vehicle routing problem with time windows
- Solving the skiving stock problem by a combination of stabilized column generation and the reflect arc-flow model
- A branch-and-price algorithm for the capacitated vehicle routing problem with stochastic demands
- A branch-price-and-cut algorithm for the capacitated multiple vehicle traveling purchaser problem with unitary demand
- Vehicle routing with soft time windows and stochastic travel times: a column generation and branch-and-price solution approach
- Optimization methods: an applications-oriented primer
- Decomposition of loosely coupled integer programs: a multiobjective perspective
- Bilevel programming and the separation problem
- Real-time freight locomotive rescheduling and uncovered train detection during disruption
- Vehicle routing problems with alternative paths: an application to on-demand transportation
- Decomposition-based heuristic for the zoning and crop planning problem with adjacency constraints
- Stabilizing branch-and-price for constrained tree problems
- A set packing model for the partition coloring problem
- Railway crew scheduling: models, methods and applications
- A two-stage solution approach for personalized multi-department multi-day shift scheduling
- The single machine weighted mean squared deviation problem
- Mixed-integer linear programming formulations and column generation algorithms for the minimum normalized cuts problem on networks
- The vertex \(k\)-cut problem
- Analytic centre stabilization of column generation algorithm for the capacitated vehicle routing problem
- Branch-and-cut-and-price for multi-agent path finding
- A machine-learning-based column generation heuristic for electric bus scheduling
- A set-covering based heuristic algorithm for the periodic vehicle routing problem
- Bidirectional labeling in column-generation algorithms for pickup-and-delivery problems
- Exact solution of the soft-clustered vehicle-routing problem
- A branch-and-price-and-cut algorithm for the cable-routing problem in solar power plants
- The min-max close-enough arc routing problem
- Using public transport in a 2-echelon last-mile delivery network
- Dynamic constraint aggregation for solving very large-scale airline crew pairing problems
- Operational fixed job scheduling problem under spread time constraints: a branch-and-price algorithm
- Assigning Team Tasks and Multiple Activities to Fixed Work Shifts
- Compact and extended formulations for the virtual network embedding problem
- Exact and heuristic approaches for the maximum lifetime problem in sensor networks with coverage and connectivity constraints
- Dantzig-Wolfe reformulations for binary quadratic problems
- Cardinality minimization, constraints, and regularization: a survey
- Branch-and-price-and-cut for a service network design and hub location problem
- Bi-dynamic constraint aggregation and subproblem reduction
- Globally optimal clusterwise regression by column generation enhanced with heuristics, sequencing and ending subset optimization
- Improving blood products supply through donation tailoring
- A column-generation approach for joint mobilization and evacuation planning
- Designing WDM optical networks using branch-and-price
- Random sampling and machine learning to understand good decompositions
- Stabilized column generation
- A note on the primal-dual column generation method for combinatorial optimization
- PathWyse: a flexible, open-source library for the resource constrained shortest path problem
- A branch-and-price approach for harvest scheduling subject to maximum area restrictions
- The demand weighted vehicle routing problem
- Robust multicovers with budgeted uncertainty
- Stabilized branch-and-price algorithms for vector packing problems
- Integral Column Generation for Set Partitioning Problems with Side Constraints
- Optimal relay node placement in delay constrained wireless sensor network design
- Two exact algorithms for the traveling umpire problem
- Online capacity planning for rehabilitation treatments: an approximate dynamic programming approach
- Dantzig-Wolfe decomposition approach to the vehicle assignment problem with demand uncertainty in a hybrid hub-and-spoke network
- An exact bidirectional pulse algorithm for the constrained shortest path
- Branch-and-price and adaptive large neighborhood search for the truck and trailer routing problem with time windows
- Solution approaches for solving the log transportation problem
- Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints
- A branch-and-price-and-check model for the vehicle routing problem with location congestion
- Exact algorithms for the multi-compartment vehicle routing problem with flexible compartment sizes
- Temporal linear relaxation in IBM ILOG CP optimizer
- A branch-and-price algorithm for the robust graph coloring problem
- Searching for optimal integer solutions to set partitioning problems using column generation
- Optimal-constrained multicast sub-graph over coded packet networks
- Tramp ship routing and scheduling with voyage separation requirements
- A constraint programming-based approach to the crew scheduling problem of the Taipei mass rapid transit system
- A note on branch-and-cut-and-price
- An iterative cost-driven copy generation approach for aircraft recovery problem
- A supervised learning-driven heuristic for solving the facility location and production planning problem
- New pricing strategies and an effective exact solution framework for profit-oriented ring arborescence problems
- Data-driven distributionally robust capacitated facility location problem
- Decomposition schemes and acceleration techniques in application to production-assembly-distribution system design
- A data driven Dantzig-Wolfe decomposition framework
- Decomposition based hybrid metaheuristics
- The concrete delivery problem
- Large-scale pickup and delivery work area design
- Mining for diamonds -- matrix generation algorithms for binary quadratically constrained quadratic problems
- Branch-and-cut-and-price for the electric vehicle routing problem with time windows, piecewise-linear recharging and capacitated recharging stations
- An exact algorithm for the partition coloring problem
- A new heuristic branching scheme for the crew pairing problem with base constraints
- Combined column-and-row-generation for the optimal communication spanning tree problem
- A branch-and-price algorithm for scheduling of deteriorating jobs and flexible periodic maintenance on a single machine
- Branch-and-price-and-cut for large-scale multicommodity capacitated fixed-charge network design
- A column generation heuristic for a dynamic generalized assignment problem
- An exact algorithm for a vehicle routing problem with time windows and multiple use of vehicles
- Column generation for service assignment in cloud-based manufacturing
- Speeding up column generation for robust wireless network planning
- Stabilized column generation for the temporal knapsack problem using dual-optimal inequalities
- Branch-price-and-cut algorithms for the pickup and delivery problem with time windows and multiple stacks
- A column generation approach for locating roadside clinics in Africa based on effectiveness and equity
- The multiple Steiner TSP with order constraints: complexity and optimization algorithms
- A branch-cut-and-price algorithm for the vehicle routing problem with stochastic demands
- Enhanced compact models for the connected subgraph problem and for the shortest path problem in digraphs with negative cycles
- Efficient branching rules for optimizing range and order-based objective functions
- Dantzig-Wolfe decomposition and branch-and-price solving in G12
- Stabilized branch-price-and-cut for the commodity-constrained split delivery vehicle routing problem
- A branch-and-price algorithm for the multi-activity multi-task shift scheduling problem
- Flexible weekly tour scheduling for postal service workers using a branch and price
- Dantzig-Wolfe decomposition for the facility location and production planning problem
- Branch-and-price and beam search algorithms for the variable cost and size bin packing problem with optional items
This page was built for publication: Column Generation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5316721)
