A Branch-and-Price Algorithm for the Generalized Assignment Problem
From MaRDI portal
Publication:4384084
DOI10.1287/opre.45.6.831zbMath0895.90161MaRDI QIDQ4384084
Publication date: 20 April 1998
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/01e2d1a738e297dd7d725816613144b3e9baab00
Related Items
Column-Generation in Integer Linear Programming, Branch and cut methods for network optimization, A tabu search heuristic for the generalized assignment problem, A family of inequalities for the generalized assignment polytope, Genetic clustering algorithms., A branch-and-price algorithm for the Steiner tree packing problem., 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., On compact formulations for integer programs solved by column generation, Comparison of wavelength requirements between two wavelength assignment methods in survivable WDM networks, A column generation approach to the heterogeneous fleet vehicle routing problem, An LP-based heuristic procedure for the generalized assignment problem with special ordered sets, Short-term work scheduling with job assignment flexibility for a multi-fleet transport system, A branch-and-price algorithm to solve the molten iron allocation problem in iron and steel industry, Lagrangian relaxation guided problem space search heuristics for generalized assignment problems, Aircraft and crew scheduling for fractional ownership programs, Column generation in the integral simplex method, An algorithm for the generalized quadratic assignment problem, Complementary column generation and bounding approaches for set partitioning formulations, Logic cuts for multilevel generalized assignment problems., Effective algorithm and heuristic for the generalized assignment problem., A multi-depot pickup and delivery problem with a single hub and heterogeneous vehicles, Lagrangean relaxation. (With comments and rejoinder)., Circulation of railway rolling stock: a branch-and-price approach, Roll assortment optimization in a paper mill: an integer programming approach, A very large-scale neighborhood search algorithm for the multi-resource generalized assignment problem, 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, Lower and upper bounds for a two-level hierarchical location problem in computer networks, Branch-and-price-and-cut on the clique partitioning problem with minimum clique size requirement, A cut and branch approach for the capacitated \(p\)-median problem based on Fenchel cutting planes, Solving a class of stochastic mixed-integer programs with branch and price, An integrated inventory-routing system for multi-item joint replenishment with limited vehicle capacity, A path relinking approach with ejection chains for the generalized assignment problem, Branch-and-price algorithms for the dual bin packing and maximum cardinality bin packing problem, Bid evaluation in procurement auctions with piecewise linear supply curves, An ejection chain approach for the generalized assignment problem, Very large-scale variable neighborhood search for the generalized assignment problem
