A Branch-and-Price Algorithm for the Generalized Assignment Problem
From MaRDI portal
Publication:4384084
DOI10.1287/opre.45.6.831zbMath0895.90161OpenAlexW2059961050MaRDI 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
Patient appointment scheduling at hemodialysis centers: an exact branch and price approach, Lagrangean relaxation. (With comments and rejoinder)., A strong conic quadratic reformulation for machine-job assignment with controllable processing times, Robust optimization approach for a chance-constrained binary knapsack problem, Optimal relay node placement in delay constrained wireless sensor network design, Consistency Cuts for Dantzig-Wolfe Reformulations, A generalization of column generation to accelerate convergence, On solving the Lagrangian dual of integer programs via an incremental approach, 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, An optimization-based heuristic for the machine reassignment problem, Determining the \(K\)-best solutions of knapsack problems, Multi-neighborhood local search optimization for machine reassignment problem, 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 column generation approach to the heterogeneous fleet vehicle routing problem, Classification of Dantzig-Wolfe reformulations for binary mixed integer programming problems, Supply capacity acquisition and allocation with uncertain customer demands, 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, When serial batch scheduling involves parallel batching decisions: a branch and price scheme, Lagrangian relaxation guided problem space search heuristics for generalized assignment problems, Multi-period traffic routing in satellite networks, A three-phase matheuristic algorithm for the multi-day task assignment problem, An integer programming column generation principle for heuristic search methods, 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, The equilibrium generalized assignment problem and genetic algorithm, Logic cuts for multilevel generalized assignment problems., 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, Simultaneous column-and-row generation for large-scale linear programs with column-dependent-rows, Two heuristic solution concepts for the vehicle selection problem in line haul transports, Effective algorithm and heuristic for the generalized assignment problem., Branch-and-price approach for the multi-skill project scheduling problem, The capacitated mobile facility location problem, Aircraft and crew scheduling for fractional ownership programs, Generalized cover facet inequalities for the generalized assignment problem, Lower and upper bounds for a two-level hierarchical location problem in computer networks, A column generation approach for the split delivery vehicle routing problem, A branch-and-price algorithm for the scheduling of customer visits in the context of multi-period service territory design, Column generation in the integral simplex method, Branch-and-price-and-cut on the clique partitioning problem with minimum clique size requirement, Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning, A facility neighborhood search heuristic for capacitated facility location with single-source constraints and flexible demand, Sequential testing of \(n\)-out-of-\(n\) systems: precedence theorems and exact methods, A cut and branch approach for the capacitated \(p\)-median problem based on Fenchel cutting planes, An exact method with variable fixing for solving the generalized assignment problem, Using branch-and-price to determine optimal treatment plans for volumetric modulated arc therapy (VMAT), Group-scheduling problems in electronics manufacturing, A computational study of exact knapsack separation for the generalized assignment problem, Optimization models for targeted offers in direct marketing: exact and heuristic algorithms, A new extended formulation of the generalized assignment problem and some associated valid inequalities, Branch and cut methods for network optimization, A COMPREHENSIVE SURVEY OF THE REVIEWER ASSIGNMENT PROBLEM, Branch and Win: OR tree search algorithms for solving combinatorial optimisation problems., A tabu search heuristic for the generalized assignment problem, Non-cyclic train timetabling and comparability graphs, 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, Bees algorithm for generalized assignment problem, A family of inequalities for the generalized assignment polytope, The stochastic transportation problem with single sourcing, Genetic clustering algorithms., Solving a class of stochastic mixed-integer programs with branch and price, 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, Very large-scale variable neighborhood search for the generalized assignment problem, A branch-and-price algorithm for placement routing for a multi-head beam-type component placement tool, A hybrid tabu search/branch \& bound approach to solving the generalized assignment problem, Optimal ABC inventory classification using interval programming, Exact algorithms for integrated facility location and production planning problems, An algorithm for the generalized quadratic assignment problem, Complementary column generation and bounding approaches for set partitioning formulations, Solving the Pricing Problem in a Branch-and-Price Algorithm for Graph Coloring Using Zero-Suppressed Binary Decision Diagrams, Rank-Cluster-and-Prune: An algorithm for generating clusters in complex set partitioning problems, Competence-based assignment of tasks to workers in factories with demand-driven manufacturing, Developing work schedules for an inter-city transit system with multiple driver types and fleet types, Knapsack constraint reformulation: A new approach that significantly reduces the number of sub-problems in the branch and bound algorithm, The Fixed-Charge Shortest-Path Problem, Column-Generation in Integer Linear Programming, An inexact bundle variant suited to column generation, An exact algorithm for the redundancy allocation problem with heterogeneous components under the mixed redundancy strategy, A computational evaluation of a general branch-and-price framework for capacitated network location problems, Multi-commodity supply network planning in the forest supply chain, Exact Solution Methods for a Generalized Assignment Problem with Location/Allocation Considerations, Chebyshev center based column generation, Local search intensified: very large-scale variable neighborhood search for the multi-resource generalized assignment problem, Robust drone selective routing in humanitarian transportation network assessment, A multi-depot pickup and delivery problem with a single hub and heterogeneous vehicles, 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, Variable-fixing then subgradient optimization guided very large scale neighborhood search for the generalized assignment problem, Decomposition of loosely coupled integer programs: a multiobjective perspective, On compact formulations for integer programs solved by column generation
