Column Generation
From MaRDI portal
Publication:5316721
DOI10.1007/b135457zbMath1084.90002OpenAlexW4241051765MaRDI QIDQ5316721
No author found.
Publication date: 14 September 2005
Full work available at URL: https://doi.org/10.1007/b135457
Collections of articles of miscellaneous specific interest (00B15) Proceedings, conferences, collections, etc. pertaining to operations research and mathematical programming (90-06)
Related Items
Stabilized column generation for the temporal knapsack problem using dual-optimal inequalities, Analytic centre stabilization of column generation algorithm for the capacitated vehicle routing problem, Max-min fairness in multi-commodity flows, Column generation based heuristic for tactical planning in multi-period vehicle routing, ONLINE CAPACITY PLANNING FOR REHABILITATION TREATMENTS: AN APPROXIMATE DYNAMIC PROGRAMMING APPROACH, Calculating the best dual bound for problems with multiple Lagrangian relaxations, Vehicle routing problems with alternative paths: an application to on-demand transportation, A branch-and-price-and-check model for the vehicle routing problem with location congestion, Solving a rich vehicle routing and inventory problem using column generation, Stabilizing branch‐and‐price for constrained tree problems, A Branch-and-Price Framework for Decomposing Graphs into Relaxed Cliques, Exact Branch-Price-and-Cut for a Hospital Therapist Scheduling Problem with Flexible Service Locations and Time-Dependent Location Capacity, A branch-cut-and-price algorithm for the traveling salesperson problem with hotel selection, Dantzig-Wolfe decomposition for the facility location and production planning problem, A stand-alone branch-and-price algorithm for identical parallel machine scheduling with conflicts, Distributed asynchronous column generation, Branch‐price‐and‐cut for the truck–drone routing problem with time windows, The vertex \(k\)-cut problem, Column generation for service assignment in cloud-based manufacturing, Branch‐and‐price for energy optimization in multi‐hop wireless sensor networks, Linear edge costs and labeling algorithms: The case of the time‐dependent vehicle routing problem with time windows, An exact bidirectional pulse algorithm for the constrained shortest path, Integral Column Generation for Set Partitioning Problems with Side Constraints, A data driven Dantzig-Wolfe decomposition framework, New pricing strategies and an effective exact solution framework for profit-oriented ring arborescence problems, Integer programming models for round Robin tournaments, Stabilized branch-price-and-cut for the commodity-constrained split delivery vehicle routing problem, Progressive Selection Method for the Coupled Lot-Sizing and Cutting-Stock Problem, Solving the skiving stock problem by a combination of stabilized column generation and the reflect arc-flow model, Assigning Team Tasks and Multiple Activities to Fixed Work Shifts, Dantzig-Wolfe decomposition and branch-and-price solving in G12, Learning to repeatedly solve routing problems, Exact and heuristic approaches for the maximum lifetime problem in sensor networks with coverage and connectivity constraints, Solving the electricity production planning problem by a column generation based heuristic, Simultaneous column-and-row generation for large-scale linear programs with column-dependent-rows, Combined location and routing problems for drug distribution, A branch-and-price algorithm for the robust graph coloring problem, From High-Level Model to Branch-and-Price Solution in G12, Bi-dynamic constraint aggregation and subproblem reduction, Optimization Methods: An Applications-Oriented Primer, A branch-and-price algorithm for the capacitated vehicle routing problem with stochastic demands, Characterizing IRDP-instances of the skiving stock problem by means of polyhedral theory, Searching for optimal integer solutions to set partitioning problems using column generation, Resource extension functions: properties, inversion, and generalization to segments, A generic view of Dantzig--Wolfe decomposition in mixed integer programming, Operational fixed job scheduling problem under spread time constraints: a branch-and-price algorithm, A column generation approach for the maximal covering location problem, Decomposing inventory routing problems with approximate value functions, Branch-and-price-and-cut for large-scale multicommodity capacitated fixed-charge network design, Solving the temporal knapsack problem via recursive Dantzig-Wolfe reformulation, Vehicle routing with soft time windows and stochastic travel times: a column generation and branch-and-price solution approach, A branch-and-cut-and-price algorithm for the cumulative capacitated vehicle routing problem, A unified solution framework for multi-attribute vehicle routing problems, Automatic Dantzig-Wolfe reformulation of mixed integer programs, Modeling and solving a multimodal transportation problem with flexible-time and scheduled services, The Team Orienteering Pick-Up and Delivery Problem with Time Windows and its applications in fleet sizing, A note on the primal-dual column generation method for combinatorial optimization, A Branch-and-Price-and-Cut Algorithm for the Cable-Routing Problem in Solar Power Plants, Dantzig-Wolfe reformulations for binary quadratic problems, Decomposition-based heuristic for the zoning and crop planning problem with adjacency constraints, Globally optimal clusterwise regression by column generation enhanced with heuristics, sequencing and ending subset optimization, Improving blood products supply through donation tailoring, Optimal relay node placement in delay constrained wireless sensor network design, 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, Temporal linear relaxation in IBM ILOG CP optimizer, Dantzig-Wolfe decomposition approach to the vehicle assignment problem with demand uncertainty in a hybrid hub-and-spoke network, A generalization of column generation to accelerate convergence, Tramp ship routing and scheduling with voyage separation requirements, Two exact algorithms for the traveling umpire problem, Decomposition based hybrid metaheuristics, Mining for diamonds -- matrix generation algorithms for binary quadratically constrained quadratic problems, Branch-and-cut-and-price for multi-agent path finding, Branch-and-cut-and-price for the electric vehicle routing problem with time windows, piecewise-linear recharging and capacitated recharging stations, 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, Enhanced compact models for the connected subgraph problem and for the shortest path problem in digraphs with negative cycles, A hybrid column generation with GRASP and path relinking for the network load balancing problem, The concrete delivery problem, A branch-cut-and-price algorithm for the vehicle routing problem with stochastic demands, Optimal interval scheduling with a resource constraint, A new formulation and approach for the black and white traveling salesman problem, An exact algorithm for the partition coloring problem, Solving the bus evacuation problem and its variants, A new heuristic branching scheme for the crew pairing problem with base constraints, Branch-and-price and adaptive large neighborhood search for the truck and trailer routing problem with time windows, Combined column-and-row-generation for the optimal communication spanning tree problem, The multiple Steiner TSP with order constraints: complexity and optimization algorithms, Large-scale pickup and delivery work area design, A branch-and-price algorithm for scheduling of deteriorating jobs and flexible periodic maintenance on a single machine, Adapting the \textit{ng}-path relaxation for bike balancing problems, A branch-price-and-cut algorithm for the commodity constrained split delivery vehicle routing problem, Solution algorithms for synchronous flow shop problems with two dominating machines, A column generation approach for the rail crew re-scheduling problem, Modeling and solving profitable location and distribution problems, Multi-period traffic routing in satellite networks, Designing WDM optical networks using branch-and-price, Real-time freight locomotive rescheduling and uncovered train detection during disruption, Column generation based heuristics for a generalized location routing problem with profits arising in space exploration, A note on branch-and-cut-and-price, A column-generation approach for joint mobilization and evacuation planning, Flexible weekly tour scheduling for postal service workers using a branch and price, A two-phase mathematical-programming heuristic for flexible assignment of activities and tasks to work shifts, A branch-and-price algorithm for the multi-activity multi-task shift scheduling problem, Bilevel programming and the separation problem, A set-covering based heuristic algorithm for the periodic vehicle routing problem, Branch-cut-and-price for scheduling deliveries with time windows in a direct shipping network, Optimization of occupancy rate in dial-a-ride problems via linear fractional column generation, A branch-and-price approach for harvest scheduling subject to maximum area restrictions, Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints, A branch-price-and-cut algorithm for the capacitated multiple vehicle traveling purchaser problem with unitary demand, Liner shipping service scheduling and cargo allocation, Decomposition schemes and acceleration techniques in application to production-assembly-distribution system design, Dynamic constraint aggregation for solving very large-scale airline crew pairing problems, Branch-and-cut-and-price for capacitated connected facility location, Nested branch-and-price-and-cut for vehicle routing problems with multiple resource interdependencies, Branch-and-price and beam search algorithms for the variable cost and size bin packing problem with optional items, Compact and extended formulations for the virtual network embedding problem, Dual relaxations of the time-indexed ILP formulation for min-sum scheduling problems, Solution approaches for solving the log transportation problem, Integrated optimization of strategic and tactical planning decisions in forestry, Branch-and-price-and-cut for a service network design and hub location problem, A new cross decomposition method for stochastic mixed-integer linear programming, The single machine weighted mean squared deviation problem, The demand weighted vehicle routing problem, Bidirectional labeling in column-generation algorithms for pickup-and-delivery problems, Robust multicovers with budgeted uncertainty, Directed weighted improper coloring for cellular channel allocation, Branch-and-price-and-cut for the multiple traveling repairman problem with distance constraints, The distance constrained multiple vehicle traveling purchaser problem, A branch-and-price algorithm to solve the integrated berth allocation and yard assignment problem in bulk ports, A constraint programming-based approach to the crew scheduling problem of the Taipei mass rapid transit system, Exact solution of the soft-clustered vehicle-routing problem, Performances improvement of the column generation algorithm: application to vehicle routing problems, The fairest core in cooperative games with transferable utilities, A column generation based heuristic for sensor placement, activity scheduling and data routing in wireless sensor networks, Stabilized branch-and-price algorithms for vector packing problems, Data-driven distributionally robust capacitated facility location problem, Exact algorithms for the multi-compartment vehicle routing problem with flexible compartment sizes, Bidirectional labeling for solving vehicle routing and truck driver scheduling problems, Railway crew scheduling: models, methods and applications, Random sampling and machine learning to understand good decompositions, Branch-and-cut-and-price for the cardinality-constrained multi-cycle problem in kidney exchange, Sequencing surgical cases in a day-care environment: an exact branch-and-price approach, A column generation heuristic for a dynamic generalized assignment problem, Speeding up column generation for robust wireless network planning, Models and algorithms for solving combined vehicle and crew scheduling problems with rest constraints: An application to road feeder service planning in air cargo transportation, New exact techniques applied to a class of network flow formulations, Design and implementation of a modular interior-point solver for linear optimization, A branch-and-price algorithm for the two-dimensional level strip packing problem, A shortest path-based approach to the multileaf collimator sequencing problem, A column generation and a post optimization VNS heuristic for the vehicle routing problem with multiple time Windows, An exact algorithm for a vehicle routing problem with time windows and multiple use of vehicles, A two-stage solution approach for personalized multi-department multi-day shift scheduling, Decomposition of loosely coupled integer programs: a multiobjective perspective, A fast metaheuristic for the travelling salesperson problem with hotel selection, Optimal-constrained multicast sub-graph over coded packet networks, The min-max close-enough arc routing problem
Uses Software
