The following pages link to (Q5519710):
Displaying 50 items.
- Boundary Labeling with Octilinear Leaders (Q3512462) (← links)
- Santa Claus Meets Hypergraph Matchings (Q3541783) (← links)
- On Map Labeling with Leaders (Q3644729) (← links)
- Local Search Heuristics for the Multidimensional Assignment Problem (Q3655144) (← links)
- A unified framework for primal-dual methods in minimum cost network flow problems (Q3683845) (← links)
- Incremental Processing Applied to Munkres’ Algorithm and Its Application in Steinberg’s Placement Procedure (Q3687699) (← links)
- Efficient dual simplex algorithms for the assignment problem (Q3701192) (← links)
- Optimality in transient markov chains and linear programming (Q3869105) (← links)
- An algorithm for then×n optimum assignment problem (Q3890004) (← links)
- A new algorithm for the assignment problem (Q3911685) (← links)
- Structured Connectivity Augmentation (Q4555048) (← links)
- On Analyzing Cost Allocation Problems: Cooperation Building Structures and Order Problem Representations (Q4557739) (← links)
- Multistart Branch and Bound for Large Asymmetric Distance-Constrained Vehicle Routing Problem (Q4596148) (← links)
- Sparse Models for Intrinsic Shape Correspondence (Q4603064) (← links)
- Analysis and Experimental Study of Heuristics for Job Scheduling Reoptimization Problems (Q4609785) (← links)
- (Q4636980) (← links)
- (Q4638113) (← links)
- Finding real-valued single-source shortest paths in o(n 3) expected time (Q4645916) (← links)
- Improving a primal–dual simplex-type algorithm using interior point methods (Q4646555) (← links)
- Wasserstein Dictionary Learning: Optimal Transport-Based Unsupervised Nonlinear Dictionary Learning (Q4686929) (← links)
- Statistical solutions of hyperbolic systems of conservation laws: Numerical approximation (Q4960350) (← links)
- Development and implementation of algorithms for vehicle routing during a no-notice evacuation (Q4966752) (← links)
- (Q4969074) (← links)
- Turbo‐SMT: Parallel coupled sparse matrix‐Tensor factorizations and applications (Q4970200) (← links)
- Vertex nomination via seeded graph matching (Q4970326) (← links)
- Closing Gaps in Asymptotic Fair Division (Q4986806) (← links)
- Notes on Hazard-Free Circuits (Q4986809) (← links)
- The Potential of Family-Free Genome Comparison (Q4992763) (← links)
- Scalable Semidefinite Programming (Q4999352) (← links)
- Empirical Regularized Optimal Transport: Statistical Theory and Applications (Q5027034) (← links)
- Maximum and optimal 1-2 matching problem of the different kind (Q5035028) (← links)
- Multilayer Modularity Belief Propagation to Assess Detectability of Community Structure (Q5037576) (← links)
- Index Matrices as a Cost Optimization Tool of Resource Provisioning in Uncertain Cloud Computing Environment (Q5051125) (← links)
- (Q5054582) (← links)
- A separation between tropical matrix ranks (Q5055609) (← links)
- Recent Results and Open Problems in Evolutionary Multiobjective Optimization (Q5055974) (← links)
- Generalized XOR non-locality games with graph description on a square lattice (Q5059833) (← links)
- On Parameterised Quadratic Inverse Eigenvalue Problem (Q5061736) (← links)
- Smallest Singular Value Based Newton-Like Methods for Solving Quadratic Inverse Eigenvalue Problem (Q5061745) (← links)
- A METRIC PROCEDURE FOR CARDINAL PREFERENCES (Q5075646) (← links)
- GERoMe – A Novel Graph Extraction Robustness Measure (Q5082145) (← links)
- Node Matching Computation Between Two Large Graphs in Linear Computational Cost (Q5082148) (← links)
- Exact Computation of Graph Edit Distance for Uniform and Non-uniform Metric Edit Costs (Q5082158) (← links)
- Decycling bipartite graphs (Q5084689) (← links)
- (Q5088931) (← links)
- INTERVAL EDGE-COLORINGS OF TREES WITH RESTRICTIONS ON THE EDGES (Q5100181) (← links)
- The Capacitated and Economic Districting Problem (Q5106398) (← links)
- Structured Connectivity Augmentation (Q5111243) (← links)
- A Distributed-Memory Algorithm for Computing a Heavy-Weight Perfect Matching on Bipartite Graphs (Q5132024) (← links)
- Causal inferences from many experiments (Q5138755) (← links)
