Pages that link to "Item:Q852938"
From MaRDI portal
The following pages link to Assignment problems: a golden anniversary survey (Q852938):
Displaying 50 items.
- The generalized assignment problem with minimum quantities (Q257215) (← links)
- A MIP model for scheduling India's general elections and police movement (Q260654) (← links)
- Reducing multivalued discrete variables in solving separable task assignment problems (Q290332) (← links)
- Scheduling with few changes (Q299829) (← links)
- Polynomially solvable personnel rostering problems (Q320874) (← links)
- Double resource optimization for a robust computer network subject to a transmission budget (Q331840) (← links)
- Modelling and planning public cultural schedules for efficient use of resources (Q337501) (← links)
- Fast machine reassignment (Q338866) (← links)
- Multi-neighborhood local search optimization for machine reassignment problem (Q342289) (← links)
- On optimal partitions, individual values and cooperative games: does a wiser agent always produce a higher value? (Q506382) (← links)
- A reduction approach to the repeated assignment problem (Q531433) (← links)
- Multistate components assignment problem with optimal network reliability subject to assignment budget (Q555430) (← links)
- Lagrangian heuristic for a class of the generalized assignment problems (Q611434) (← links)
- Determining type II sensitivity ranges of the fractional assignment problem (Q631220) (← links)
- Random assignment problems (Q953417) (← links)
- Repulsive assignment problem (Q963661) (← links)
- Routing traffic at hub facilities (Q972437) (← links)
- A Lagrangian bound for many-to-many assignment problems (Q975754) (← links)
- Order acceptance and due-date quotation in low machine rates (Q1630128) (← links)
- The matching relaxation for a class of generalized set partitioning problems (Q1634772) (← links)
- Quality assurance laboratory planning system to maximize worker preference subject to certification and preference balance constraints (Q1652302) (← links)
- Tabu search and iterated local search for the cyclic bottleneck assignment problem (Q1652664) (← links)
- Efficient sensor network management for asset localization (Q1654358) (← links)
- Tug scheduling for hinterland barge transport: a branch-and-price approach (Q1681331) (← links)
- Product allocation to different types of distribution center in retail logistics networks (Q1681420) (← links)
- Utilizing individual picker skills to improve order batching in a warehouse (Q1694830) (← links)
- Coordinated lab-clinics: a tactical assignment problem in healthcare (Q1695040) (← links)
- An exact algorithm for the minimum squared load assignment problem (Q1734825) (← links)
- Probabilistic tabu search for the cross-docking assignment problem (Q1740539) (← links)
- Improved Lagrangian bounds and heuristics for the generalized assignment problem (Q1745880) (← links)
- Minimizing the number of tardy jobs on a proportionate flowshop with general position-dependent processing times (Q1762149) (← links)
- The dominance assignment problem (Q1926493) (← links)
- An optimal capacity assignment for the robust design problem in capacitated flow networks (Q1930731) (← links)
- Optimal double-resource assignment for the robust design problem in multistate computer networks (Q1991322) (← links)
- A novel convex dual approach to three-dimensional assignment problem: theoretical analysis (Q2007830) (← links)
- Studying properties of Lagrangian bounds for many-to-many assignment problems (Q2017507) (← links)
- A dual approach to multi-dimensional assignment problems (Q2052387) (← links)
- College admissions with ties and common quotas: integer programming approach (Q2077946) (← links)
- Optimized planning of nursing curricula in dual vocational schools focusing on the German health care system (Q2079435) (← links)
- A greedy and distributable approach to the Lexicographic Bottleneck Assignment Problem with conditions on exactness (Q2125539) (← links)
- Baggage carousel assignment at airports: model and case study (Q2226501) (← links)
- Optimization for dynamic ride-sharing: a review (Q2253345) (← links)
- Integer programming models for the multidimensional assignment problem with star costs (Q2256320) (← links)
- Assignment problems with changeover cost (Q2267319) (← links)
- Fair task allocation problem (Q2288963) (← links)
- Loading tow trains ergonomically for just-in-time part supply (Q2301970) (← links)
- Packing items into several bins facilitates approximating the separable assignment problem (Q2345851) (← links)
- Optimal double-resource assignment for a distributed multistate network (Q2351293) (← links)
- Competitive strategies for an online generalized assignment problem with a service consecution constraint (Q2355803) (← links)
- Calculating the best dual bound for problems with multiple Lagrangian relaxations (Q2391512) (← links)
