A Branch-and-Price Algorithm for the Generalized Assignment Problem
From MaRDI portal
Publication:4384084
DOI10.1287/OPRE.45.6.831zbMATH Open0895.90161OpenAlexW2059961050MaRDI QIDQ4384084FDOQ4384084
Authors: Martin W. P. Savelsbergh 
Publication date: 20 April 1998
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/01e2d1a738e297dd7d725816613144b3e9baab00
Recommendations
- Solving the generalized assignment problem: an optimizing and heuristic approach
- Technical Note—An Improved Dual Based Algorithm for the Generalized Assignment Problem
- A survey of algorithms for the generalized assignment problem
- Effective algorithm and heuristic for the generalized assignment problem.
- The generalized assignment problem
Cited In (only showing first 100 items - show all)
- Primal Heuristics for Branch-and-Price Algorithms
- Decomposition of loosely coupled integer programs: a multiobjective perspective
- Build-pack planning for hard disk drive assembly with approved vendor matrices and stochastic demands
- A comparison of alternative models for solving a non-linear single plant hydro unit commitment problem
- Exact solutions to a class of stochastic generalized assignment problems
- Knapsack constraint reformulation: A new approach that significantly reduces the number of sub-problems in the branch and bound algorithm
- A comprehensive survey of the reviewer assignment problem
- The capacitated mobile facility location problem
- Using branch-and-price to determine optimal treatment plans for volumetric modulated arc therapy (VMAT)
- An integer programming approach to the time slot assignment problem in SS/TDMA systems with intersatellite links
- Branch and Win: OR tree search algorithms for solving combinatorial optimisation problems.
- Consistency cuts for Dantzig-Wolfe reformulations
- A branch-and-price algorithm for the scheduling of customer visits in the context of multi-period service territory design
- Generalized cover facet inequalities for the generalized assignment problem
- Generalized target-allocation functions and their evaluation by the branch-and-bound method
- Sequential testing of \(n\)-out-of-\(n\) systems: precedence theorems and exact methods
- Comparison of wavelength requirements between two wavelength assignment methods in survivable WDM networks
- A three-phase matheuristic algorithm for the multi-day task assignment problem
- Branch-and-price algorithms for large-scale mission-oriented maintenance planning problems
- Bid evaluation in procurement auctions with piecewise linear supply curves
- Short-term work scheduling with job assignment flexibility for a multi-fleet transport system
- Exact algorithms for integrated facility location and production planning problems
- Patient appointment scheduling at hemodialysis centers: an exact branch and price approach
- Multi-period traffic routing in satellite networks
- Exact solution methods for a generalized assignment problem with location/allocation considerations
- BRANCHING TECHNIQUE FOR A BI-OBJECTIVE TWO-STAGE ASSIGNMENT PROBLEM
- The fixed-charge shortest-path problem
- An efficient algorithm for a class of generalized assignment problem
- Chebyshev center based column generation
- A network flow algorithm for solving generalized assignment problem
- A generalization of column generation to accelerate convergence
- Title not available (Why is that?)
- An exact algorithm for the redundancy allocation problem with heterogeneous components under the mixed redundancy strategy
- When serial batch scheduling involves parallel batching decisions: a branch and price scheme
- Branch and cut methods for network optimization
- Very large-scale variable neighborhood search for the generalized assignment problem
- Rank-Cluster-and-Prune: An algorithm for generating clusters in complex set partitioning problems
- A branch-and-branch algorithm for solving the group technology problem
- An ejection chain approach for the generalized assignment problem
- Solving a class of two-stage stochastic nonlinear integer programs using value functions
- A branch-and-price algorithm for the Steiner tree packing problem.
- Robust drone selective routing in humanitarian transportation network assessment
- Aircraft and crew scheduling for fractional ownership programs
- A new extended formulation of the generalized assignment problem and some associated valid inequalities
- Electric vehicle-based express service network design with recharging management: a branch-and-price approach
- Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning
- An integer programming column generation principle for heuristic search methods
- Variable-fixing then subgradient optimization guided very large scale neighborhood search for the generalized assignment problem
- Branch-and-price algorithms for the dual bin packing and maximum cardinality bin packing problem
- A Branch-and-Price Algorithm for the Multiperiod Single-Sourcing Problem
- A very large-scale neighborhood search algorithm for the multi-resource generalized assignment problem
- On Dantzig-Wolfe Decomposition in Integer Programming and ways to Perform Branching in a Branch-and-Price Algorithm
- Lower and upper bounds for a two-level hierarchical location problem in computer networks
- A cut and branch approach for the capacitated \(p\)-median problem based on Fenchel cutting planes
- A path relinking approach with ejection chains for the generalized assignment problem
- An integrated inventory-routing system for multi-item joint replenishment with limited vehicle capacity
- Optimization models for targeted offers in direct marketing: exact and heuristic algorithms
- A branch-and-price algorithm to solve the molten iron allocation problem in iron and steel industry
- A branch-and-price approach for the stochastic generalized assignment problem
- Classification of Dantzig-Wolfe reformulations for binary mixed integer programming problems
- A strong conic quadratic reformulation for machine-job assignment with controllable processing times
- A survey of algorithms for the generalized assignment problem
- The equilibrium generalized assignment problem and genetic algorithm
- A Branch-and-Price Algorithm for the Multilevel Generalized Assignment Problem
- Supply capacity acquisition and allocation with uncertain customer demands
- Branching in branch-and-price: A generic scheme
- Robust optimization approach for a chance-constrained binary knapsack problem
- Branch-and-price and constraint programming for solving a real-life technician dispatching problem
- Optimal relay node placement in delay constrained wireless sensor network design
- Solving a class of stochastic mixed-integer programs with branch and price
- Title not available (Why is that?)
- Two heuristic solution concepts for the vehicle selection problem in line haul transports
- Branch-and-Price Guided Search
- Column-Generation in Integer Linear Programming
- A column generation approach for the split delivery vehicle routing problem
- Complementary column generation and bounding approaches for set partitioning formulations
- A Survey of the Generalized Assignment Problem and Its Applications
- A branch and price solution approach for order acceptance and capacity planning in make-to-order operations
- Column generation in the integral simplex method
- An algorithm for the generalized quadratic assignment problem
- A column generation heuristic for a dynamic generalized assignment problem
- A branch and price algorithm to minimize makespan on a single batch processing machine with non-identical job sizes
- Algorithms for the generalized quadratic assignment problem combining Lagrangean decomposition and the reformulation-linearization technique
- Branch-and-price approach for the multi-skill project scheduling problem
- A tabu search heuristic for the generalized assignment problem
- An LP-based heuristic procedure for the generalized assignment problem with special ordered sets
- A column generation approach to the heterogeneous fleet vehicle routing problem
- Lagrangian relaxation guided problem space search heuristics for generalized assignment problems
- An optimization-based heuristic for the machine reassignment problem
- A branch and price algorithm for the pharmacy duty scheduling problem
- Multi-neighborhood local search optimization for machine reassignment problem
- The stochastic transportation problem with single sourcing
- Group-scheduling problems in electronics manufacturing
- Developing work schedules for an inter-city transit system with multiple driver types and fleet types
- Lagrangean relaxation. (With comments and rejoinder).
- An algorithm for the bottleneck generalized assignment problem
- Determining the \(K\)-best solutions of knapsack problems
- Solving the pricing problem in a branch-and-price algorithm for graph coloring using zero-suppressed binary decision diagrams
- An exact method with variable fixing for solving the generalized assignment problem
- A hybrid tabu search/branch \& bound approach to solving the generalized assignment problem
This page was built for publication: A Branch-and-Price Algorithm for the Generalized Assignment Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4384084)
