Entity usage
From MaRDI portal
This page lists pages that use the given entity (e.g. Q42). The list is sorted by descending page ID, so that newer pages are listed first.
Showing below up to 13 results in range #1 to #13.
- Simple Metaheuristics Using the Simplex Algorithm for Non-linear Programming: Label: en
- Formulation Space Search for Circle Packing Problems: Label: en
- A Multi-sphere Scheme for 2D and 3D Packing Problems: Label: en
- Local Search in Complex Scheduling Problems: Label: en
- A Study of Neighborhood Structures for the Multiple Depot Vehicle Scheduling Problem: Label: en
- A Set Covering Approach for the Pickup and Delivery Problem with General Constraints on Each Route: Label: en
- Solving a Bi-objective Vehicle Routing Problem by Pareto-Ant Colony Optimization: Label: en
- A Bidirectional Greedy Heuristic for the Subspace Selection Problem: Label: en
- Probabilistic Beam Search for the Longest Common Subsequence Problem: Label: en
- A Path Relinking Approach for the Multi-Resource Generalized Quadratic Assignment Problem: Label: en
- An Algorithm Portfolio for the Sub-graph Isomorphism Problem: Label: en
- Mixed Models for the Analysis of Local Search Components: Label: en
- Comparing Variants of MMAS ACO Algorithms on Pseudo-Boolean Functions: Label: en