The following pages link to (Q4217266):
Displayed 37 items.
- Chips on wafers, or packing rectangles into grids (Q705545) (← links)
- Towards an analytic framework for analysing the computation time of evolutionary algorithms (Q814443) (← links)
- The stochastic location-assignment problem on a tree (Q816410) (← links)
- On combinatorial optimization problems on matroids with uncertain weights (Q856278) (← links)
- Breast cancer prediction using the isotonic separation technique (Q877069) (← links)
- Stochastic dominance-based rough set model for ordinal classification (Q955714) (← links)
- Finding a bounded mixed-integer solution to a system of dual network inequalities (Q957371) (← links)
- Random weighting, asymptotic counting, and inverse isoperimetry (Q995359) (← links)
- The one-to-one shortest-path problem: An empirical analysis with the two- tree Dijkstra algorithm (Q1260623) (← links)
- Persistency in maximum cardinality bipartite matchings (Q1332944) (← links)
- A linear programming approach to reasoning about probabilities (Q1356219) (← links)
- A new extension of local search applied to the Dial-A-Ride problem (Q1388930) (← links)
- Optimization with randomized search heuristics -- the (A)NFL theorem, realistic scenarios, and difficult functions. (Q1853460) (← links)
- A least-squares primal-dual algorithm for solving linear programming problems (Q1866990) (← links)
- Max-algebra: The linear algebra of combinatorics? (Q1873718) (← links)
- The fastest itinerary in time-dependent decentralized travel information systems (Q2369978) (← links)
- Using expert knowledge in solving the seismic inverse problem (Q2382784) (← links)
- Hamiltonicity of regular graphs and blocks of consecutive ones in symmetric matrices (Q2457012) (← links)
- Coupled map lattices as spatio-temporal fitness functions: Landscape measures and evolutionary optimization (Q2477688) (← links)
- Logistics scheduling with batching and transportation (Q2482765) (← links)
- Sources of complexity in subset choice (Q2483826) (← links)
- The complexity of maximum matroid--greedoid intersection and weighted greedoid maximiza\-tion (Q2489961) (← links)
- Safe projections of binary data sets (Q2491217) (← links)
- Church's thesis meets the \(N\)-body problem (Q2497884) (← links)
- A semidefinite programming based polyhedral cut and price approach for the maxcut problem (Q2506169) (← links)
- MDSM: microarray database schema matching using the Hungarian method (Q2509219) (← links)
- Principles of cost minimisation in wireless networks (Q2573007) (← links)
- Optimal security liquidation algorithms (Q2574056) (← links)
- A decision procedure for linear ``big O'' equations (Q2642465) (← links)
- Learning parallel portfolios of algorithms (Q2643151) (← links)
- A new metric between distributions of point processes (Q3535647) (← links)
- Heuristic scheduling of parallel machines with sequence-dependent set-up times (Q4443334) (← links)
- One line and n points (Q4446873) (← links)
- A note on the parity assignment problem (Q5423148) (← links)
- Tree search algorithm for assigning cooperating UAVs to multiple tasks (Q5443601) (← links)
- Set covering approach for reconstruction of sibling relationships (Q5758164) (← links)
- Three-dimensional embedded subband coding with optimized truncation (3-D ESCOT) (Q5942637) (← links)