The following pages link to describes a project that uses (P1463):
Displaying 50 items.
- On the kidney exchange problem: cardinality constrained cycle and chain problems on directed graphs: a survey of integer programming approaches (Q512864) (← links)
- A robust optimization model for agile and build-to-order supply chain planning under uncertainties (Q512903) (← links)
- Static target search path planning optimization with heterogeneous agents (Q512934) (← links)
- Exact methods for solving the elementary shortest and longest path problems (Q512936) (← links)
- A \(k\)-level data structure for large-scale traveling salesman problems (Q512957) (← links)
- Profit maximization and reduction of the cannibalization effect in chain expansion (Q512981) (← links)
- A short-turning policy for the management of demand disruptions in rapid transit systems (Q512986) (← links)
- New local searches for solving the multi-source Weber problem (Q512988) (← links)
- A parallelized lagrangean relaxation approach for the discrete ordered median problem (Q512991) (← links)
- Maximizing the minimum cover probability by emergency facilities (Q512997) (← links)
- Retrial queueing models in discrete time: a short survey of some late arrival models (Q513037) (← links)
- MRSPN analysis of semi-Markovian finite source retrial queues (Q513044) (← links)
- Environmental corporate responsibility for investments evaluation: an alternative multi-objective programming model (Q513081) (← links)
- Multi-criteria decision making for choosing socially responsible investment within a behavioral portfolio theory framework: a new way of investing into a crisis environment (Q513098) (← links)
- Assessing e-participation via user's satisfaction measurement: the case of OurSpace platform (Q513104) (← links)
- Using multiobjective mathematical programming to link national competitiveness, productivity, and innovation (Q513109) (← links)
- Connecting a population dynamic model with a multi-period location-allocation problem for post-disaster relief operations (Q513117) (← links)
- Dynamic conditional value-at-risk model for routing and scheduling of hazardous material transportation networks (Q513121) (← links)
- A multiple attribute group decision making framework for the evaluation of lean practices at logistics distribution centers (Q513123) (← links)
- Operational and economic efficiency analysis of public hospitals in Greece (Q513128) (← links)
- Deriving advantage over a crisis by incorporating a new class of stochastic models for risk control operations (Q513132) (← links)
- Experimental analysis of crossover and mutation operators on the quadratic assignment problem (Q513133) (← links)
- An eigenvalue decomposition based branch-and-bound algorithm for nonconvex quadratic programming problems with convex quadratic constraints (Q513160) (← links)
- Multiple depot ring star problem: a polyhedral study and an exact algorithm (Q513163) (← links)
- Branch and bound algorithm with applications to robust stability (Q513164) (← links)
- Covers and approximations in multiobjective optimization (Q513168) (← links)
- Relaxations and discretizations for the pooling problem (Q513173) (← links)
- Heuristic solution approaches for the maximum minsum dispersion problem (Q513174) (← links)
- Supervisory control for collision avoidance in vehicular networks using discrete event abstractions (Q513177) (← links)
- Computation of the delay bounds and synthesis of diagnosers for decentralized diagnosis with conditional decisions (Q513180) (← links)
- Maximally permissive controlled system synthesis for non-determinism and modal logic (Q513185) (← links)
- Diagnosability analysis of patterns on bounded labeled prioritized Petri nets (Q513189) (← links)
- Fractal dimensions of self-avoiding walks and Ising high-temperature graphs in 3D conformal bootstrap (Q513196) (← links)
- New properties for certain positive semidefinite matrices (Q513214) (← links)
- An explicit description of the irreducible components of the set of matrix pencils with bounded normal rank (Q513221) (← links)
- On local quadratic convergence of inexact simplified Jacobi-Davidson method (Q513233) (← links)
- Certifying 3-edge-connectivity (Q513265) (← links)
- A polynomial time approximation scheme for the closest shared center problem (Q513292) (← links)
- Reconstructing phylogenetic level-1 networks from nondense binet and trinet sets (Q513300) (← links)
- Engineering parallel string sorting (Q513306) (← links)
- Improving configuration checking for satisfiable random \(k\)-SAT instances (Q513324) (← links)
- About some UP-based polynomial fragments of SAT (Q513329) (← links)
- Weighted heuristic anytime search: new schemes for optimization over graphical models (Q513336) (← links)
- Boosting conditional probability estimators (Q513339) (← links)
- Compact representations of all members of an independence system (Q513340) (← links)
- Probabilistic knowledge representation using the principle of maximum entropy and Gröbner basis theory (Q513343) (← links)
- Dualization of Boolean functions using ternary decision diagrams (Q513353) (← links)
- Analyzing restricted fragments of the theory of linear arithmetic (Q513354) (← links)
- Integral traces of weak Maass forms of genus zero odd prime level (Q513374) (← links)
- Survey of control performance in quantum information processing (Q513409) (← links)
