The following pages link to (Q5519710):
Displaying 50 items.
- An extended assignment problem considering multiple inputs and outputs (Q2470282) (← links)
- Graph similarity scoring and matching (Q2472827) (← links)
- Fair referee assignments for professional football leagues (Q2475851) (← links)
- Collaborative assignment using belief-desire-intention agent modeling and negotiation with speedup strategies (Q2476755) (← links)
- An efficient simple metaheuristic for minimizing the makespan in two-machine no-wait job shops (Q2482377) (← links)
- Lower bounds for the earliness-tardiness scheduling problem on parallel machines with distinct due dates (Q2482802) (← links)
- An algorithm for ranking assignments using reoptimization (Q2483518) (← links)
- Minimizing weighted earliness-tardiness and due-date cost with unit processing-time jobs (Q2490167) (← links)
- Exact solutions to a class of stochastic generalized assignment problems (Q2496071) (← links)
- Multiple task assignments for cooperating uninhabited aerial vehicles using genetic algorithms (Q2499159) (← links)
- An efficient approach for the rank aggregation problem (Q2503315) (← links)
- Ascending price Vickrey auctions (Q2506307) (← links)
- Side constraints and non-price attributes in markets (Q2506312) (← links)
- Addressing capacity uncertainty in resource-constrained assignment problems (Q2566939) (← links)
- Transfers and exchange-stability in two-sided matching problems (Q2629324) (← links)
- Bi-Lipschitz bijection between the Boolean cube and the Hamming ball (Q2630133) (← links)
- The optimal tenement allocation for reducing traffic burden (Q2630839) (← links)
- Solving the many to many assignment problem by improving the Kuhn-Munkres algorithm with backtracking (Q2634668) (← links)
- Jacobi's bound for a diffiety defined by a quasi-regular system (Q2643115) (← links)
- Attributed relational graph matching based on the nested assignment structure (Q2654263) (← links)
- A linguistic approach to classification of bacterial genomes (Q2654290) (← links)
- 3D model comparison using spatial structure circular descriptor (Q2654302) (← links)
- An exact branch-and-price approach for the medical student scheduling problem (Q2668624) (← links)
- Improved instance generation for kidney exchange programmes (Q2669768) (← links)
- Task preference-based bottleneck assignment problem (Q2675766) (← links)
- Pallet location and job scheduling in a twin-robot system (Q2676351) (← links)
- A Novel SDP Relaxation for the Quadratic Assignment Problem Using Cut Pseudo Bases (Q2835697) (← links)
- Complexity and Approximation Results for the Balance Optimization Subset Selection Model for Causal Inference in Observational Studies (Q2940541) (← links)
- Approximability of Two Variants of Multiple Knapsack Problems (Q2947034) (← links)
- Some complexity and approximation results for coupled-tasks scheduling problem according to topology (Q2954345) (← links)
- ADM-CLE Approach for Detecting Slow Variables in Continuous Time Markov Chains and Dynamic Data (Q2964446) (← links)
- Linear Time Approximation Algorithms for Degree Constrained Subgraph Problems (Q2971609) (← links)
- Near Approximation of Maximum Weight Matching through Efficient Weight Reduction (Q3010385) (← links)
- Similarity Indices for Spatia I Ecological Data (Q3078766) (← links)
- (Q3143813) (← links)
- Index Reduction via Unimodular Transformations (Q3176353) (← links)
- Linear-Time Approximation for Maximum Weight Matching (Q3189636) (← links)
- Ganzzahlige Programmierungen. Theorie und Anwendungen in der Praxis (Q3270232) (← links)
- A sparse algorithm for dense optimal transport (Q3300344) (← links)
- Correlation function for the Grid-Poisson Euclidean matching on a line and on a circle (Q3301809) (← links)
- Research on solution space of bipartite graph vertex-cover by maximum matchings (Q3302166) (← links)
- Constrained target controllability of complex networks (Q3303090) (← links)
- 3/4-Discrete Optimal Transport (Q3303986) (← links)
- Bilinear Assignment Problem: Large Neighborhoods and Experimental Analysis of Algorithms (Q3386794) (← links)
- Rössler-network with time delay: Univariate impulse pinning synchronization (Q3388139) (← links)
- (Q3388763) (← links)
- Some aspects on solving transportation problem (Q3388797) (← links)
- Design of Dynamic Algorithms via Primal-Dual Method (Q3448786) (← links)
- Community Detection in Temporal Multilayer Networks, with an Application to Correlation Networks (Q3459668) (← links)
- On the use of suboptimal matchings for scaling and ordering sparse symmetric matrices (Q3466259) (← links)
