Pages that link to "Item:Q3255799"
From MaRDI portal
The following pages link to Algorithms for the Assignment and Transportation Problems (Q3255799):
Displayed 50 items.
- On the added value of bootstrap analysis for \(K\)-means clustering (Q269548) (← links)
- Minimum cost input/output design for large-scale linear structural systems (Q274009) (← links)
- Prioritizing replenishments of the piece picking area (Q299855) (← links)
- Branch-and-bound with decomposition-based lower bounds for the traveling umpire problem (Q322545) (← links)
- A clustering ensemble framework based on elite selection of weighted clusters (Q354184) (← links)
- A grid-based approach to formation reconfiguration for a class of robots with non-holonomic constraints (Q389789) (← links)
- Effective feature construction by maximum common subgraph sampling (Q413859) (← links)
- Using local similarity measures to efficiently address approximate graph matching (Q496650) (← links)
- Composability and controllability of structural linear time-invariant systems: distributed verification (Q518300) (← links)
- Privacy by diversity in sequential releases of databases (Q528678) (← links)
- A genuinely polynomial primal simplex algorithm for the assignment problem (Q686416) (← links)
- Local ratio with negative weights. (Q703278) (← links)
- Scheduling two-machine no-wait open shops to minimize makespan (Q707009) (← links)
- Fast algorithms for placing large entries along the diagonal of a sparse matrix (Q708297) (← links)
- Regularized optimization with spatial coupling for robust decision making (Q723991) (← links)
- Approximation algorithms for the bus evacuation problem (Q724742) (← links)
- Heuristics for the mixed swapping problem (Q733528) (← links)
- Fréchet means for distributions of persistence diagrams (Q742821) (← links)
- Deep learning observables in computational fluid dynamics (Q777521) (← links)
- Profit maximization for competitive social advertising (Q831129) (← links)
- Incremental assignment problem (Q865928) (← links)
- Maximum travelling salesman problem. I (Q891481) (← links)
- Distribution functions, extremal limits and optimal transport (Q898076) (← links)
- Maximum weight bipartite matching in matrix multiplication time (Q1035683) (← links)
- Lower bounds for the axial three-index assignment problem (Q1040985) (← links)
- A case of non-convergent dual changes in assignment problems (Q1063519) (← links)
- A geometrical interpretation of the Hungarian method (Q1245144) (← links)
- A branch-and-bound algorithm for the quadratic assignment problem based on the Hungarian method (Q1296800) (← links)
- Massively parallel augmenting path algorithms for the assignment problem (Q1365535) (← links)
- Analysis of ground state in random bipartite matching (Q1619038) (← links)
- Detecting almost symmetries of graphs (Q1621684) (← links)
- Satisfied two-sided matching: a method considering elation and disappointment of agents (Q1626247) (← links)
- From the bankruptcy problem and its concede-and-divide solution to the assignment problem and its fair division solution (Q1651272) (← links)
- GM-PHD filter combined with track-estimate association and numerical interpolation (Q1666191) (← links)
- Approximation of graph edit distance based on Hausdorff matching (Q1677056) (← links)
- Optimization methods for the train unit shunting problem (Q1683138) (← links)
- The complexity and on-line algorithm for automated storage and retrieval system with stacker cranes on one rail (Q1691943) (← links)
- Auction dynamics: a volume constrained MBO scheme (Q1700735) (← links)
- Multi-machine scheduling with interval constrained position-dependent processing times (Q1716992) (← links)
- Multiobjective optimization for a wireless ad hoc sensor distribution on shaped-bounded areas (Q1721436) (← links)
- 2CoBel: a scalable belief function representation for 2D discernment frames (Q1726302) (← links)
- The unit acquisition number of a graph (Q1732112) (← links)
- A local branching heuristic for solving a graph edit distance problem (Q1734846) (← links)
- Natalie 2.0: sparse global network alignment as a special case of quadratic assignment (Q1736730) (← links)
- On searching and indexing sequences of temporal intervals (Q1741320) (← links)
- Critical objective function values in linear sum assignment problems (Q1743488) (← links)
- Cluster ensembles: a survey of approaches with recent extensions and applications (Q1750312) (← links)
- Collaborative vehicle routing: a survey (Q1754297) (← links)
- Approximation algorithms for the max-buying problem with limited supply (Q1755724) (← links)
- Uncertain programming model for uncertain optimal assignment problem (Q1788760) (← links)