Branch-and-Price: Column Generation for Solving Huge Integer Programs
From MaRDI portal
Publication:2770133
DOI10.1287/opre.46.3.316zbMath0979.90092OpenAlexW2167580124WikidataQ56814662 ScholiaQ56814662MaRDI QIDQ2770133
Nemhauser, George I., Savelsbergh, Martin W. P., Pamela H. Vance, Cynthia Barnhart, Ellis L. Johnson
Publication date: 7 February 2002
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/764cbb2d06d95a2f983b3683a0b9103aaeae7968
column generationinteger programsbranch-and-bound algorithmsLagrangian dualityLP relaxationbranch-and-bound treespecial branching rules
Integer programming (90C10) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04)
Related Items
Stabilizing branch‐and‐price for constrained tree problems, Matheuristics: survey and synthesis, Column elimination for capacitated vehicle routing problems, The rendezvous vehicle routing problem, “Make no little plans”: Impactful research to solve the next generation of transportation problems, A column generation approach for the team formation problem, Branch‐and‐price for energy optimization in multi‐hop wireless sensor networks, Application of decomposition techniques in a wildfire suppression optimization model, Single machine parallel-batch scheduling under time-of-use electricity prices: new formulations and optimisation approaches, Columnwise neighborhood search: A novel set partitioning matheuristic and its application to the <scp>VeRoLog</scp> Solver Challenge 2019, A Nested Cross Decomposition Algorithm for Power System Capacity Expansion with Multiscale Uncertainties, Decision Diagrams for Discrete Optimization: A Survey of Recent Advances, Integral Column Generation for Set Partitioning Problems with Side Constraints, Integer programming column generation: accelerating branch-and-price using a novel pricing scheme for finding high-quality solutions in set covering, packing, and partitioning problems, Efficient learning of large sets of locally optimal classification rules, A Maritime Pulp Distribution Problem, Solving large-scale dynamic vehicle routing problems with stochastic requests, Improving energy aware nanosatellite task scheduling by a branch-cut-and-price algorithm, Stochastic inventory routing with time-based shipment consolidation, Branch-and-price algorithms for large-scale mission-oriented maintenance planning problems, New pricing strategies and an effective exact solution framework for profit-oriented ring arborescence problems, A combinatorial flow-based formulation for temporal bin packing problems, Adaptive solution prediction for combinatorial optimization, Day-ahead aircraft routing with data-driven primary delay predictions, A branch‐and‐price algorithm for identical parallel machine scheduling with multiple milestones, A Column Generation Model for Truck Routing in the Chilean Forest Industry, Clique Inequalities Applied to the Vehicle Routing Problem with Time Windows, Assigning Team Tasks and Multiple Activities to Fixed Work Shifts, Electric aircraft charging network design for regional routes: a novel mathematical formulation and kernel search heuristic, Solving a real-world multi-depot multi-period petrol replenishment problem with complex loading constraints, A branch‐and‐price‐based heuristic for the vehicle routing problem with two‐dimensional loading constraints and time windows, Learning to repeatedly solve routing problems, Combining metaheuristics with mathematical programming, constraint programming and machine learning, Deriving compact extended formulations via LP-based separation techniques, Optimization in liner shipping, Exact Approaches for Network Design Problems with Relays, A Joint Vehicle Routing and Speed Optimization Problem, From High-Level Model to Branch-and-Price Solution in G12, A column generation approach for the split delivery vehicle routing problem, A Complementary Column Generation Approach for the Graph Equipartition Problem, Optimization in liner shipping, Combining metaheuristics with mathematical programming, constraint programming and machine learning, Constraint programming-based column generation, Deriving compact extended formulations via LP-based separation techniques, Searching for optimal integer solutions to set partitioning problems using column generation, Lower bounds and algorithms for the 2-dimensional vector packing problem, Constraint programming-based column generation, A branch-and-price algorithm for the Steiner tree packing problem., A rollout algorithm for the resource constrained elementary shortest path problem, Exact algorithms for integrated facility location and production planning problems, Ray projection for optimizing polytopes with prohibitively many constraints in set-covering column generation, \textsc{Laps}\ \textsc{Care} -- an operational system for staff planning of home care, A new novel local search integer-programming-based heuristic for PCB assembly on collect-and-place machines, Solving the minimum convex partition of point sets with integer programming, A discrete meta-control procedure for approximating solutions to binary programs, An exact algorithm for an integrated project staffing problem with a homogeneous workforce, A mixed integer programming approach to multi-skilled workforce scheduling, Workforce scheduling and routing problems: literature survey and computational study, Irregular polyomino tiling via integer programming with application in phased array antenna design, Globally optimal clusterwise regression by column generation enhanced with heuristics, sequencing and ending subset optimization, BoxStep methods for crew pairing problems, A comparison of five heuristics for the multiple depot vehicle scheduling problem, Branch-and-price and constraint programming for solving a real-life technician dispatching problem, All-integer column generation for set partitioning: basic principles and extensions, Branch-and-price algorithm for the resilient multi-level hop-constrained network design, An extension of the relaxation algorithm for solving a special case of capacitated arc routing problems, The timetable constrained distance minimization problem, Combining column generation and constraint programming to solve the tail assignment problem, A two-level approach to large mixed-integer programs with application to cogeneration in energy-efficient buildings, Alternative approaches to the crude oil tanker routing and scheduling problem with split pickup and split delivery, An effective branch-and-price algorithm for the preemptive resource constrained project scheduling problem based on minimal interval order enumeration, A branch-price-and-cut method for the vegetable crop rotation scheduling problem with minimal plot sizes, A branch-cut-and-price algorithm for the piecewise linear transportation problem, Scheduling pumpoff operations in onshore oilfields under electric-power constraints, The multi-vehicle traveling purchaser problem with pairwise incompatibility constraints and unitary demands: a branch-and-price approach, Branch-and-price algorithms for the solution of the multi-trip vehicle routing problem with time windows, A branch-and-price algorithm for stable workforce assignments with hierarchical skills, Decomposition approaches for recoverable robust optimization problems, Increasing the revenue of self-storage warehouses by optimizing order scheduling, Optimal allocation of emergency medical resources in a mass casualty incident: patient prioritization by column generation, A column generation approach for solving the examination-timetabling problem, Scheduling cranes at an indented berth, Lower bounding procedure for the asymmetric quadratic traveling salesman problem, Maximizing expected number of transplants in kidney exchange programs, A branch-and-price algorithm for scheduling parallel machines with sequence dependent setup times, Computing minimal forecast horizons: an integer programming approach, A heuristic for the multi-satellite, multi-orbit and multi-user management of Earth observation satellites, Managing large fixed costs in vehicle routing and crew scheduling problems solved by column generation, Hybrid column generation for large-size covering integer programs: application to transportation planning, A multilevel integrative approach to hospital case mix and capacity planning, Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches, Tactical fixed job scheduling with spread-time constraints, Optimal interval scheduling with a resource constraint, Optimal shift partitioning of pharmacies, The production routing problem: a review of formulations and solution algorithms, Mathematical models and algorithms for a high school timetabling problem, The impact of reserve duties on the robustness of a personnel shift roster: an empirical investigation, A \texttt{cost-regular} based hybrid column generation approach, A constraint programming based column generation approach to nurse rostering problems, A branch-price-and-cut method for a ship routing and scheduling problem with split loads, Hybrid methods for lot sizing on parallel machines, A branch-price-and-cut algorithm for the commodity constrained split delivery vehicle routing problem, Optimized load planning for motorail transportation, A branch and price algorithm for the pharmacy duty scheduling problem, Comparison of wavelength requirements between two wavelength assignment methods in survivable WDM networks, A branch-and-price algorithm for the capacitated facility location problem, Composite-variable modeling for service parts logistics, A column generation approach to the heterogeneous fleet vehicle routing problem, A hub location problem with fully interconnected backbone and access networks, Short-term work scheduling with job assignment flexibility for a multi-fleet transport system, ATM VP-based network design, Efficient techniques for the multi-period vehicle routing problem with time windows within a branch and price framework, OSPF routing with optimal oblivious performance ratio under polyhedral demand uncertainty, Branch-and-price algorithms for the two-echelon capacitated vehicle routing problem, A robust optimization approach to dispatching technicians under stochastic service times, An exact solution procedure for multi-item two-echelon spare parts inventory control problem with batch ordering in the central warehouse, 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, Orbital branching, A comparison of stochastic programming and bi-objective optimisation approaches to robust airline crew scheduling, Elective course planning, Exact optimization for the \(\ell ^{1}\)-compressive sensing problem using a modified Dantzig-Wolfe method, Information-theoretic approaches to branching in search, A branch-and-price approach for harvest scheduling subject to maximum area restrictions, Divide-and-price: a decomposition algorithm for solving large railway crew scheduling problems, Analysis of programming properties and the row-column generation method for 1-norm support vector machines, Branching in branch-and-price: A generic scheme, Mathematical model for cyclic scheduling with work-in-process minimization, Branch-and-price approach for the multi-skill project scheduling problem, Branch-and-cut-and-price for capacitated connected facility location, A new exact algorithm to solve the multi-trip vehicle routing problem with time windows and limited duration, A robust framework for task-related resident scheduling, A decomposition approach for commodity pickup and delivery with time-windows under uncertainty, Solving the maximum edge biclique packing problem on unbalanced bipartite graphs, Dual relaxations of the time-indexed ILP formulation for min-sum scheduling problems, Multi-pattern generation framework for logical analysis of data, A column generation based algorithm for the robust graph coloring problem, Polylithic modeling and solution approaches using algebraic modeling systems, Hooked on IP, Exact approaches for integrated aircraft fleeting and routing at TunisAir, Optimization models for targeted offers in direct marketing: exact and heuristic algorithms, Shipment planning at oil refineries using column generation and valid inequalities, Dual variable based fathoming in dynamic programs for column generation, Algorithms for the one-dimensional two-stage cutting stock problem, Total flow time minimization in a flowshop sequence-dependent group scheduling problem, Speeding up column generation for robust wireless network planning, Chebyshev center based column generation, Sparse hierarchical regression with polynomials, A decomposition method for large scale MILPs, with performance guarantees and a power system application, On compact formulations for integer programs solved by column generation, Constraint programming and operations research, Task assignment with start time-dependent processing times for personnel at check-in counters, A column generation approach and new bounds for the car sequencing problem, An exact algorithm for IP column generation, An exact algorithm for the partition coloring problem, Full-shipload tramp ship routing and scheduling with variable speeds, Vehicle routing with probabilistic capacity constraints, Lane covering with partner bounds in collaborative truckload transportation procurement, Generic Pareto local search metaheuristic for optimization of targeted offers in a bi-objective direct marketing campaign, A new heuristic branching scheme for the crew pairing problem with base constraints, Column generation strategies and decomposition approaches for the two-stage stochastic multiple knapsack problem, A shortest-path-based approach for the stochastic knapsack problem with non-decreasing expected overfilling costs, A branch-and-price algorithm for scheduling of deteriorating jobs and flexible periodic maintenance on a single machine, Accelerating the branch-and-price algorithm using machine learning, A branch-and-price algorithm for solving the cutting strips problem, Algorithms for railway crew management, A column generation approach for the rail crew re-scheduling problem, Maximizing system lifetime in wireless sensor networks, A branch-and-price algorithm to solve the molten iron allocation problem in iron and steel industry, Branch-and-price algorithm for fuzzy integer programming problems with block angular structure, Dynamic constraint and variable aggregation in column generation, A heuristic approach to minimize the number of saw cycles in small-scale furniture factories, Delay resistant line planning with a view towards passenger transfers, Scheduling fighter squadron training missions using column generation, Benders decomposition and column-and-row generation for solving large-scale linear programs with column-dependent-rows, A branch-and-price algorithm for the aperiodic multi-period service scheduling problem, Exploiting variable associations to configure efficient local search algorithms in large-scale binary integer programs, Optimizing railway crew schedules with fairness preferences, Staff scheduling and rostering: a review of applications, methods and models., Liner shipping service scheduling and cargo allocation, Supply chain optimization in the pulp mill industry -- IP models, column generation and novel constraint branches., An optimization approach for planning daily drayage operations, A branch and price algorithm for EOS constellation imaging and downloading integrated scheduling problem, Using high performance computing for unrelated parallel machine scheduling with sequence-dependent setup times: development and computational evaluation of a parallel branch-and-price algorithm, A column generation approach to capacitated \(p\)-median problems, Integrated districting, fleet composition, and inventory planning for a multi-retailer distribution system, The sport teams grouping problem, Airport ground workforce planning with hierarchical skills: a new formulation and branch-and-price approach, A Branch and Price algorithm for the \(k\)-splittable maximum flow problem, An enhanced MILP-based branch-and-price approach to modularity density maximization on graphs, Aircraft and crew scheduling for fractional ownership programs, A column generation approach to train timetabling on a corridor, The quay crane scheduling problem with non-crossing and safety clearance constraints: an exact solution approach, A branch-and-price algorithm for the scheduling of customer visits in the context of multi-period service territory design, An efficient computational method for large scale surgery scheduling problems with chance constraints, Column generation in the integral simplex method, Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning, Optimization over structured subsets of positive semidefinite matrices via column generation, A dual ascent procedure for the set partitioning problem, Integrating rolling stock scheduling with train unit shunting, Branch-and-price-and-cut for a service network design and hub location problem, An optimization approach to designing a baseball scout network, Optimisation of maintenance routing and scheduling for offshore wind farms, A new cross decomposition method for stochastic mixed-integer linear programming, A branch-and-price algorithm for the two-dimensional vector packing problem with piecewise linear cost function, A mixed integer programming model for multiple stage adaptive testing, Integer programming techniques for educational timetabling, Branch-price-and-cut for the mixed capacitated general routing problem with time windows, An integer programming approach to generating airline crew pairings, Modelling transfer line design problem via a set partitioning problem, An anytime deduction algorithm for the probabilistic logic and entailment problems, Group-scheduling problems in electronics manufacturing, Oil production optimization solved by piecewise linearization in a branch \& price framework, New linearizations of quadratic assignment problems, Strong bounds with cut and column generation for class-teacher timetabling, A computational study of Benders decomposition for the integrated aircraft routing and crew scheduling problem, A branch-and-price approach to \(p\)-median location problems, Branching strategies in a branch-and-price approach for a multiple objective nurse scheduling problem, Large-scale optimization planning methods for the distribution of United States army munitions, Network design formulations for scheduling U.S. air force channel route missions, A branch and price algorithm to minimize makespan on a single batch processing machine with non-identical job sizes, A branch-and-price algorithm for the vehicle routing problem with deliveries, selective pickups and time windows, Semiconductor lot allocation using robust optimization, A branch-and-price algorithm for placement routing for a multi-head beam-type component placement tool, Exact and hybrid methods for the multiperiod field service routing problem, Robust crew pairing for managing extra flights, Complementary column generation and bounding approaches for set partitioning formulations, Long-term staffing based on qualification profiles, Sequencing surgical cases in a day-care environment: an exact branch-and-price approach, Developing work schedules for an inter-city transit system with multiple driver types and fleet types, Cliques and clustering: A combinatorial approach, Introduction to ABACUS -- a branch-and-cut system, Solving a tactical operating room planning problem by a column-generation-based heuristic procedure with four criteria, Multi-commodity supply network planning in the forest supply chain, Locomotive assignment with heterogeneous consists at CN North America, The asymmetric traveling salesman problem with replenishment arcs, An exact algorithm for a vehicle routing problem with time windows and multiple use of vehicles, Plant location with minimum inventory, Hybridizing exact methods and metaheuristics: a taxonomy, The impact of distribution system characteristics on computational tractability, Optimization engineering techniques for the exact solution of NP-hard combinatorial optimization problems, Time-indexed formulations for scheduling chains on a single machine: an application to airborne radars, An iterative approach to robust and integrated aircraft routing and crew scheduling, A generalized linear programming model for nurse scheduling, A multi-depot pickup and delivery problem with a single hub and heterogeneous vehicles, HOP: A software tool for production scheduling at Bridgestone/Firestone Off-The-Road, A parallel primal-dual simplex algorithm, Evolution and state-of-the-art in integer programming, A passenger demand model for airline flight scheduling and fleet routing, A column generation based decomposition algorithm for a parallel machine just-in-time scheduling problem, Power efficient uplink scheduling in SC-FDMA: benchmarking by column generation, Petroleum supply planning: reformulations and a novel decomposition algorithm, Lagrangean relaxation. (With comments and rejoinder)., Optimization models for forest road upgrade planning, A column generation approach to the coalition formation problem in multi-agent systems, Subadditive approaches in integer programming, Distributed integral column generation for set partitioning problems, Optimal multicast route packing, Column generation approaches to ship scheduling with flexible cargo sizes, Mining for diamonds -- matrix generation algorithms for binary quadratically constrained quadratic problems, Branch-and-cut-and-price for multi-agent path finding, Finding multiple solutions to general integer linear programs, Circulation of railway rolling stock: a branch-and-price approach, Roll assortment optimization in a paper mill: an integer programming approach, The backbone method for ultra-high dimensional sparse machine learning, A resource type analysis of the integrated project scheduling and personnel staffing problem, Solving a large-scale integrated fleet assignment and crew pairing problem, Modularity maximization to design contiguous policy zones for pandemic response, The arc-item-load and related formulations for the cumulative vehicle routing problem, Sparse high-dimensional regression: exact scalable algorithms and phase transitions, A combined Lagrangian, linear programming, and implication heuristic for large-scale set partitioning problems, A hybrid K-means and integer programming method for commercial territory design: a case study in meat distribution, Multi-period traffic routing in satellite networks, A constraint programming approach for a batch processing problem with non-identical job sizes, A prototype column generation strategy for the multiple container loading problem, Column generation based heuristics for a generalized location routing problem with profits arising in space exploration, A comparison of integer programming models for the partial directed weighted improper coloring problem, Stochastic dual dynamic integer programming, Exact algorithms to minimize makespan on single and parallel batch processing machines, Design of diversified package tours for the digital travel industry: a branch-cut-and-price approach, Dynamic location of modular manufacturing facilities with relocation of individual modules, The vertex \(k\)-cut problem, An integer optimality condition for column generation on zero-one linear programs, Alternating Lagrangian decomposition for integrated airline crew scheduling problem, A branch-price-and-cut algorithm for the capacitated multiple vehicle traveling purchaser problem with unitary demand, A rotation-based branch-and-price approach for the nurse scheduling problem, Computational results with a primal-dual subproblem simplex method, Dynamic constraint aggregation for solving very large-scale airline crew pairing problems, A branch-and-price algorithm for the liner shipping network design problem, Branch-and-price for a multi-attribute technician routing and scheduling problem, An exact column-generation approach for the lot-type design problem, Scheduling jobs with normally distributed processing times on parallel machines, An exact approach for the personnel task rescheduling problem with task retiming, Adapting a kidney exchange algorithm to align with human values, Dynamic job assignment: a column generation approach with an application to surgery allocation, An exact branch-and-price algorithm for scheduling rescue units during disaster response, Column generation for vehicle routing problems with multiple synchronization constraints, A math-heuristic Dantzig-Wolfe algorithm for capacitated lot sizing, The re-planning and scheduling of surgical cases in the operating room department after block release time with resource rescheduling, Directed weighted improper coloring for cellular channel allocation, 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, Integer programming models for the multidimensional assignment problem with star costs, Stabilized branch and price with dynamic parameter updating for discontinuous tour scheduling, A graph partitioning strategy for solving large-scale crew scheduling problems, Constraint games for stable and optimal allocation of demands in SDN, A joint decomposition method for global optimization of multiscenario nonconvex mixed-integer nonlinear programs, Branch-and-price for \(p\)-cluster editing, Avoiding redundant columns by adding classical Benders cuts to column generation subproblems, Vehicle scheduling problem with loss in bus ridership, Branch and price for the vehicle routing problem with discrete Split deliveries and time windows, A column generation-based diving heuristic to solve the multi-project personnel staffing problem with calendar constraints and resource sharing, Simultaneous node and link districting in transportation networks: model, algorithms and railway application, A branch and price algorithm to solve the quickest multicommodity \(k\)-splittable flow problem, Improving set partitioning problem solutions by zooming around an improving direction, The time buffer approximated buffer allocation problem: a row-column generation approach, Fleet assignment and routing with schedule synchronization constraints, Branch-and-price for a class of nonconvex mixed-integer nonlinear programs, Solving a dial-a-flight problem using composite variables, A branch-and-price procedure for clustering data that are graph connected, Solving robust bin-packing problems with a branch-and-price approach, On the complexity of surrogate and group relaxation for integer linear programs, Scheduling with uncertain processing times in mixed-criticality systems, A feasibility-ensured Lagrangian heuristic for general decomposable problems, A column generation and a post optimization VNS heuristic for the vehicle routing problem with multiple time Windows, On the linear ordering problem and the rankability of data, Supply chain modelling of forest fuel, A survey of scheduling with parallel batch (p-batch) processing, A decomposed branch-and-price procedure for integrating demand planning in personnel staffing problems, Robust drone selective routing in humanitarian transportation network assessment, LP models for bin packing and cutting stock problems, An efficient model-based branch-and-price algorithm for unrelated-parallel machine batching and scheduling problems, A network model for airline cabin crew scheduling, A branch-and-price algorithm for the temporal bin packing problem, Bounds for probabilistic integer programming problems, Decomposition of loosely coupled integer programs: a multiobjective perspective, Minimizing total completion time in the flexible flowshop sequence-dependent group scheduling problem, Classical symmetries and the quantum approximate optimization algorithm, A set covering approach for multi-depot train driver scheduling, A fast exact pricing algorithm for the railway crew scheduling problem, A branch-and-price approach for the continuous multifacility monotone ordered median problem, Benchmarking advantage and D-wave 2000Q quantum annealers with exact cover problems, Branch-and-refine for solving time-expanded MILP formulations, Interval scheduling with economies of scale, A column generation mathematical programming approach for a class-faculty assignment problem with preferences, Timed route approaches for large multi-product multi-step capacitated production planning problems, The min-max close-enough arc routing problem, A branch-and-price algorithm for solving the single-hub feeder network design problem, Pricing, relaxing and fixing under lot sizing and scheduling, Row-reduced column generation for degenerate master problems, Data-Driven Transit Network Design at Scale, The biclique k-clustering problem in bipartite graphs and its application in bioinformatics, Strong Lower Bounds for a Survivable Network Design Problem, A Branch-and-Price Algorithm for Capacitated Arc Routing Problem with Flexible Time Windows, Outpatient appointment scheduling given individual day-dependent no-show predictions, A branch-and-price-and-cut approach for sustainable crop rotation planning, Column generation for a UAV assignment problem with precedence constraints, Randomized parameterized algorithms for the kidney exchange problem, Consistency Cuts for Dantzig-Wolfe Reformulations, A column-generation-based algorithm for a resource-constrained project scheduling problem with a fractional shared resource, Models and algorithms for three-stage two-dimensional bin packing, Classification of Dantzig-Wolfe reformulations for binary mixed integer programming problems, A Branch-and-Price Framework for Decomposing Graphs into Relaxed Cliques, Improving Column Generation for Vehicle Routing Problems via Random Coloring and Parallelization, Exact Branch-Price-and-Cut for a Hospital Therapist Scheduling Problem with Flexible Service Locations and Time-Dependent Location Capacity, Using \(\ell^p\)-norms for fairness in combinatorial optimisation, Multi-objective temporal bin packing problem: an application in cloud computing, Dantzig-Wolfe decomposition for the facility location and production planning problem, A Wide Branching Strategy for the Graph Coloring Problem, An exact branch-and-price approach for the medical student scheduling problem, Arc routing under uncertainty: introduction and literature review, A stand-alone branch-and-price algorithm for identical parallel machine scheduling with conflicts, A column generation and combinatorial Benders decomposition algorithm for the selective dial-a-ride-problem, Decomposition Branching for Mixed Integer Programming, Total coloring and total matching: polyhedra and facets, A branch-and-price algorithm for nanosatellite task scheduling to improve mission quality-of-service, On routing and scheduling a fleet of resource-constrained vessels to provide ongoing continuous patrol coverage, IBEA-SVM: an indicator-based evolutionary algorithm based on pre-selection with classification guided by SVM, Exact Algorithms for Electric Vehicle-Routing Problems with Time Windows, Operating room planning and surgical case scheduling: a review of literature, New Enhancements for the Exact Solution of the Vehicle Routing Problem with Time Windows, The Surgical Patient Routing Problem: A Central Planner Approach, Computing Near-Optimal Stable Cost Allocations for Cooperative Games by Lagrangian Relaxation, Resource-Constrained Assignment Problems with Shared Resource Consumption and Flexible Demand, Dantzig-Wolfe decomposition and branch-and-price solving in G12, Regenerator Location Problem in Flexible Optical Networks, Scheduling trainees at a hospital department using a branch-and-price approach, Build-pack planning for hard disk drive assembly with approved vendor matrices and stochastic demands, A branch-and-price approach for operational aircraft maintenance routing, Analysis of three mathematical models of the staff rostering problem, Solving the electricity production planning problem by a column generation based heuristic, Computational aspects of column generation for nonlinear and conic optimization: classical and linearized schemes, Converging upon basic feasible solutions through Dantzig-Wolfe decomposition, Unnamed Item, An interior-point Benders based branch-and-cut algorithm for mixed integer programs, Unnamed Item, A branch-and-price algorithm for the robust graph coloring problem, Detecting critical node structures on graphs: A mathematical programming approach, Bi-dynamic constraint aggregation and subproblem reduction, On the minimum cost multiple-source unsplittable flow problem, Branch and price for covering shipments in a logistic distribution network with a fleet of aircraft, Robust branch-cut-and-price for the capacitated minimum spanning tree problem over a large extended formulation, Interior point stabilization for column generation, On the trade-off between staff-decomposed and activity-decomposed column generation for a staff scheduling problem, Effective search space control for large and/or complex driver scheduling problems, Integer multicommodity flow problems, Robust Branch-Cut-and-Price Algorithms for Vehicle Routing Problems, Branch-and-price-and-cut on the clique partitioning problem with minimum clique size requirement, Unnamed Item, A master surgical scheduling approach for cyclic scheduling in operating room departments, A branch-and-price approach for integrating nurse and surgery scheduling, Modeling and solving the periodic maintenance problem, Accelerating column generation for aircraft scheduling using constraint propagation, Vehicle routing problem with elementary shortest path based column generation, Decomposition and dynamic cut generation in integer linear programming, Scenario-based approach for flexible resource loading under uncertainty, A generic view of Dantzig--Wolfe decomposition in mixed integer programming, Solving a class of stochastic mixed-integer programs with branch and price, Operational fixed job scheduling problem under spread time constraints: a branch-and-price algorithm, Column Generation Algorithms for Nonlinear Optimization, I: Convergence Analysis, Solving the Pricing Problem in a Branch-and-Price Algorithm for Graph Coloring Using Zero-Suppressed Binary Decision Diagrams, Dual Inequalities for Stabilized Column Generation Revisited, Why Does a Railway Infrastructure Company Need an Optimized Train Path Assignment for Industrialized Timetabling?, Unit Commitment by Column Generation, Mixed Integer Linear Programming Formulation Techniques, A branch-price-and-cut algorithm for the min-maxk-vehicle windy rural postman problem, Knapsack constraint reformulation: A new approach that significantly reduces the number of sub-problems in the branch and bound algorithm, An Exact Method for Balancing Efficiency and Equity in the Liver Allocation Hierarchy, Column-Generation in Integer Linear Programming, A New Branch-and-Price-and-Cut Algorithm for One-Dimensional Bin-Packing Problems, Branch and Price for Chance-Constrained Bin Packing, A Branch-Price-and-Cut Procedure for the Discrete Ordered Median Problem, A BRANCH-AND-BOUND ALGORITHM FOR A PSEUDO-BOOLEAN OPTIMIZATION PROBLEM WITH BLACK-BOX FUNCTIONS, The Team Orienteering Pick-Up and Delivery Problem with Time Windows and its applications in fleet sizing, School bus routing—a column generation approach, Hierarchical Benders Decomposition for Open-Pit Mine Block Sequencing, A Horizon Decomposition Approach for the Capacitated Lot-Sizing Problem with Setup Times, Exact Solution Methods for a Generalized Assignment Problem with Location/Allocation Considerations, Branch-Price-and-Cut Algorithms for the Vehicle Routing Problem with Stochastic and Correlated Travel Times, A Branch-and-Price Algorithm for Facility Location with General Facility Cost Functions, The Migratory Beekeeping Routing Problem: Model and an Exact Algorithm, A Branch-and-Price-and-Cut Algorithm for the Cable-Routing Problem in Solar Power Plants, Addressing Orientation Symmetry in the Time Window Assignment Vehicle Routing Problem, Cutting planes for branch-and-price algorithms, The two-dimensional bin packing problem with variable bin sizes and costs, An integrated inventory-routing system for multi-item joint replenishment with limited vehicle capacity, Bid evaluation in procurement auctions with piecewise linear supply curves, Network design with grooming constraints, Learning Optimal Decision Sets and Lists with SAT, Scheduled Service Network Design for Freight Rail Transportation
Uses Software
