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):
Displayed 49 items.
- Branch and Win: OR tree search algorithms for solving combinatorial optimisation problems. (Q703298) (← 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)
- 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)
- Lagrangean relaxation. (With comments and rejoinder). (Q1876461) (← links)
- Circulation of railway rolling stock: a branch-and-price approach (Q2384905) (← links)
- Roll assortment optimization in a paper mill: an integer programming approach (Q2384912) (← links)
- A very large-scale neighborhood search algorithm for the multi-resource generalized assignment problem (Q2386217) (← links)
- Build-pack planning for hard disk drive assembly with approved vendor matrices and stochastic demands (Q2433468) (← links)
- A branch-and-price approach for operational aircraft maintenance routing (Q2433558) (← links)
- Lower and upper bounds for a two-level hierarchical location problem in computer networks (Q2462545) (← links)
- Branch-and-price-and-cut on the clique partitioning problem with minimum clique size requirement (Q2471278) (← links)
- A cut and branch approach for the capacitated \(p\)-median problem based on Fenchel cutting planes (Q2481606) (← links)
- Solving a class of stochastic mixed-integer programs with branch and price (Q2502208) (← links)
- An integrated inventory-routing system for multi-item joint replenishment with limited vehicle capacity (Q2569152) (← links)
- A path relinking approach with ejection chains for the generalized assignment problem (Q2570155) (← links)
- Branch-and-price algorithms for the dual bin packing and maximum cardinality bin packing problem (Q2572248) (← links)
- Bid evaluation in procurement auctions with piecewise linear supply curves (Q2573006) (← links)
- An ejection chain approach for the generalized assignment problem (Q2573015) (← links)
- Classification of Dantzig-Wolfe reformulations for binary mixed integer programming problems (Q2655613) (← links)
- Supply capacity acquisition and allocation with uncertain customer demands (Q2655615) (← links)
- Very large-scale variable neighborhood search for the generalized assignment problem (Q3604030) (← links)
- Rank-Cluster-and-Prune: An algorithm for generating clusters in complex set partitioning problems (Q3621930) (← links)
- Column-Generation in Integer Linear Programming (Q4450558) (← links)
- Branch and cut methods for network optimization (Q5936762) (← links)
- A tabu search heuristic for the generalized assignment problem (Q5938390) (← links)
- A family of inequalities for the generalized assignment polytope (Q5949919) (← links)
- Genetic clustering algorithms. (Q5952444) (← links)
- A branch-and-price algorithm for the Steiner tree packing problem. (Q5952785) (← links)
- An integer programming approach to the time slot assignment problem in SS/TDMA systems with intersatellite links (Q5954827) (← links)