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.
- Using branch-and-price to determine optimal treatment plans for volumetric modulated arc therapy (VMAT) (Q2002839) (← links)
- A new extended formulation of the generalized assignment problem and some associated valid inequalities (Q2009013) (← links)
- Competence-based assignment of tasks to workers in factories with demand-driven manufacturing (Q2045620) (← links)
- An exact algorithm for the redundancy allocation problem with heterogeneous components under the mixed redundancy strategy (Q2060427) (← links)
- Robust drone selective routing in humanitarian transportation network assessment (Q2083969) (← links)
- Decomposition of loosely coupled integer programs: a multiobjective perspective (Q2097645) (← links)
- Bees algorithm for generalized assignment problem (Q2266951) (← links)
- The stochastic transportation problem with single sourcing (Q2275818) (← links)
- Variable-fixing then subgradient optimization guided very large scale neighborhood search for the generalized assignment problem (Q2336062) (← 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)
- Simultaneous column-and-row generation for large-scale linear programs with column-dependent-rows (Q2434985) (← 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)
- When serial batch scheduling involves parallel batching decisions: a branch and price scheme (Q2669619) (← links)
- Optimal ABC inventory classification using interval programming (Q2792928) (← links)
- Solving the Pricing Problem in a Branch-and-Price Algorithm for Graph Coloring Using Zero-Suppressed Binary Decision Diagrams (Q2806865) (← links)
- The Fixed-Charge Shortest-Path Problem (Q2815469) (← links)
- Exact Solution Methods for a Generalized Assignment Problem with Location/Allocation Considerations (Q2830960) (← links)
- Generalized cover facet inequalities for the generalized assignment problem (Q3553764) (← links)
- A COMPREHENSIVE SURVEY OF THE REVIEWER ASSIGNMENT PROBLEM (Q3585099) (← 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)
- Knapsack constraint reformulation: A new approach that significantly reduces the number of sub-problems in the branch and bound algorithm (Q4966750) (← links)
- Consistency Cuts for Dantzig-Wolfe Reformulations (Q5058051) (← links)
- Primal Heuristics for Branch-and-Price Algorithms (Q5176283) (← links)
- Exact algorithms for integrated facility location and production planning problems (Q5198685) (← links)
- A column generation approach for the split delivery vehicle routing problem (Q5894493) (← 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)
- A three-phase matheuristic algorithm for the multi-day task assignment problem (Q6047850) (← links)
- An integer programming column generation principle for heuristic search methods (Q6066729) (← links)
- A Survey of the Generalized Assignment Problem and Its Applications (Q6102818) (← links)
