The following pages link to (Q4217266):
Displaying 50 items.
- Approximate core allocations and integrality gap for the bin packing game (Q265072) (← links)
- The recurrent method to solve the assignment problem (Q269147) (← links)
- Irregular polyomino tiling via integer programming with application in phased array antenna design (Q288219) (← links)
- Approximation algorithms for solving the constrained arc routing problem in mixed graphs (Q297063) (← links)
- A lower bound on the expected optimal value of certain random linear programs and application to shortest paths in directed acyclic graphs and reliability (Q310679) (← links)
- The power of greedy algorithms for approximating Max-ATSP, cyclic cover, and superstrings (Q313766) (← links)
- Approximations for constructing tree-form structures using specific material with fixed length (Q315511) (← links)
- Efficient domination through eigenvalues (Q317399) (← links)
- A graph theoretic approach to input-to-state stability of switched systems (Q328048) (← links)
- Parallel learning of automatic classes of languages (Q329605) (← links)
- A proof of the duality of the DINA model and the DINO model (Q333331) (← links)
- Fast algorithm to find 2-factor of minimum weight (Q334255) (← links)
- Breakout local search for maximum clique problems (Q339563) (← links)
- A recurrent algorithm to solve the weighted matching problem (Q341372) (← links)
- Optimal discriminating designs for several competing regression models (Q355119) (← links)
- Cycle-based reducibility of multi-index transport-type systems of linear inequalities (Q357096) (← links)
- Multicriterial multi-index resource scheduling problems (Q367976) (← links)
- The empirical cost of optimal incomplete transportation (Q378795) (← links)
- Practical strategies for generating rank-1 split cuts in mixed-integer linear programming (Q384805) (← links)
- Complexity results for the basic residency scheduling problem (Q398919) (← links)
- Dimension spectra of random subfractals of self-similar fractals (Q400423) (← links)
- Fast density-weighted low-rank approximation spectral clustering (Q408661) (← links)
- Local equivalences of distances between clusterings -- a geometric perspective (Q420920) (← links)
- Models and algorithms to improve earthwork operations in road design using mixed integer linear programming (Q421690) (← links)
- A school bus scheduling problem (Q439545) (← links)
- Efficient local search algorithms for known and new neighborhoods for the generalized traveling salesman problem (Q439653) (← links)
- Multiple UAV coalitions for a search and prosecute mission (Q441436) (← links)
- Combinatorial optimization problems with uncertain costs and the OWA criterion (Q482291) (← links)
- Matrices commuting with a given normal tropical matrix (Q492753) (← links)
- Estimation of the dimensions of some Kisin varieties (Q507459) (← links)
- Continuous representations and functional extensions in combinatorial optimization (Q508577) (← links)
- Interval scheduling on related machines (Q547142) (← links)
- Permutation betting markets: singleton betting with extra information (Q547299) (← links)
- Semidefinite approximations for quadratic programs over orthogonal matrices (Q609564) (← links)
- A robust hybrid method for nonrigid image registration (Q621074) (← links)
- A review of multiobjective programming and its application in quantitative psychology (Q645494) (← links)
- Gromov-Wasserstein distances and the metric approach to object matching (Q647419) (← links)
- On the complexity of core, kernel, and bargaining set (Q650525) (← links)
- Seeking global edges for traveling salesman problem in multi-start search (Q652693) (← links)
- Threshold protocols in survivor set systems (Q661005) (← links)
- An adaptive multi-policy grid service for biological sequence comparison (Q666033) (← links)
- Unsupervised feature selection based on kernel Fisher discriminant analysis and regression learning (Q669319) (← links)
- A method of improving initial partition of Fiduccia-Mattheyses algorithm (Q669520) (← links)
- Production-process optimization algorithm: application to fed-batch bioprocess (Q682728) (← links)
- Approximation algorithms for multiple terminal, Hamiltonian path problems (Q691412) (← links)
- Chips on wafers, or packing rectangles into grids (Q705545) (← links)
- Quasi-polynomials, linear Diophantine equations and semi-linear sets (Q764313) (← 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)
- Evaluation of solution of discrete optimization problem with incomplete input (Q828663) (← links)
