Pages that link to "Item:Q4384084"
From MaRDI portal
The following pages link to A Branch-and-Price Algorithm for the Generalized Assignment Problem (Q4384084):
Displaying 50 items.
- Robust optimization approach for a chance-constrained binary knapsack problem (Q291067) (← links)
- Optimal relay node placement in delay constrained wireless sensor network design (Q297218) (← links)
- An optimization-based heuristic for the machine reassignment problem (Q338859) (← links)
- Determining the \(K\)-best solutions of knapsack problems (Q342015) (← links)
- Multi-neighborhood local search optimization for machine reassignment problem (Q342289) (← links)
- A branch and price algorithm for the pharmacy duty scheduling problem (Q342397) (← links)
- A branch and price solution approach for order acceptance and capacity planning in make-to-order operations (Q418059) (← links)
- The equilibrium generalized assignment problem and genetic algorithm (Q422905) (← links)
- Two heuristic solution concepts for the vehicle selection problem in line haul transports (Q439400) (← links)
- Branch-and-price approach for the multi-skill project scheduling problem (Q479223) (← links)
- A facility neighborhood search heuristic for capacitated facility location with single-source constraints and flexible demand (Q519091) (← links)
- Optimization models for targeted offers in direct marketing: exact and heuristic algorithms (Q541729) (← links)
- An exact method with variable fixing for solving the generalized assignment problem (Q694523) (← links)
- Branch and Win: OR tree search algorithms for solving combinatorial optimisation problems. (Q703298) (← links)
- Chebyshev center based column generation (Q765323) (← links)
- On compact formulations for integer programs solved by column generation (Q817199) (← links)
- A strong conic quadratic reformulation for machine-job assignment with controllable processing times (Q833574) (← links)
- A generalization of column generation to accelerate convergence (Q847856) (← links)
- On solving the Lagrangian dual of integer programs via an incremental approach (Q849073) (← links)
- Comparison of wavelength requirements between two wavelength assignment methods in survivable WDM networks (Q863572) (← links)
- A column generation approach to the heterogeneous fleet vehicle routing problem (Q868147) (← links)
- An LP-based heuristic procedure for the generalized assignment problem with special ordered sets (Q868998) (← links)
- Short-term work scheduling with job assignment flexibility for a multi-fleet transport system (Q869153) (← links)
- A branch-and-price algorithm to solve the molten iron allocation problem in iron and steel industry (Q878576) (← links)
- Lagrangian relaxation guided problem space search heuristics for generalized assignment problems (Q884028) (← links)
- Aircraft and crew scheduling for fractional ownership programs (Q940904) (← links)
- Column generation in the integral simplex method (Q948677) (← links)
- Group-scheduling problems in electronics manufacturing (Q964869) (← links)
- A computational study of exact knapsack separation for the generalized assignment problem (Q967219) (← links)
- Non-cyclic train timetabling and comparability graphs (Q974988) (← links)
- A branch and price algorithm to minimize makespan on a single batch processing machine with non-identical job sizes (Q976033) (← links)
- Algorithms for the generalized quadratic assignment problem combining Lagrangean decomposition and the reformulation-linearization technique (Q976396) (← links)
- A branch-and-price algorithm for placement routing for a multi-head beam-type component placement tool (Q991821) (← links)
- A hybrid tabu search/branch \& bound approach to solving the generalized assignment problem (Q992649) (← links)
- An algorithm for the generalized quadratic assignment problem (Q1001198) (← links)
- Complementary column generation and bounding approaches for set partitioning formulations (Q1001332) (← links)
- Developing work schedules for an inter-city transit system with multiple driver types and fleet types (Q1011229) (← links)
- An inexact bundle variant suited to column generation (Q1016116) (← links)
- A computational evaluation of a general branch-and-price framework for capacitated network location problems (Q1026595) (← links)
- Multi-commodity supply network planning in the forest supply chain (Q1027559) (← links)
- Local search intensified: very large-scale variable neighborhood search for the multi-resource generalized assignment problem (Q1040083) (← links)
- Logic cuts for multilevel generalized assignment problems. (Q1406973) (← links)
- Effective algorithm and heuristic for the generalized assignment problem. (Q1417503) (← links)
- A multi-depot pickup and delivery problem with a single hub and heterogeneous vehicles (Q1582189) (← links)
- The capacitated mobile facility location problem (Q1737488) (← links)
- A branch-and-price algorithm for the scheduling of customer visits in the context of multi-period service territory design (Q1744533) (← links)
- Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning (Q1751150) (← links)
- Sequential testing of \(n\)-out-of-\(n\) systems: precedence theorems and exact methods (Q1755382) (← links)
- Lagrangean relaxation. (With comments and rejoinder). (Q1876461) (← links)
- Multi-period traffic routing in satellite networks (Q1926695) (← links)
