The following pages link to describes a project that uses (P1463):
Displaying 50 items.
- Database preference queries -- a possibilistic logic approach with symbolic priorities (Q429433) (← links)
- Tightly integrated probabilistic description logic programs for representing ontology mappings (Q429437) (← links)
- Information-based distance measures and the canonical reflection of view updates (Q429442) (← links)
- Solving survivable two-layer network design problems by metric inequalities (Q429456) (← links)
- Heuristics for convex mixed integer nonlinear programs (Q429468) (← links)
- A parallel algorithm for two-staged two-dimensional fixed-orientation cutting problems (Q429470) (← links)
- A local search algorithm for ray-convex polyhedron intersection (Q429472) (← links)
- Boundary concentrated finite elements for optimal boundary control problems of elliptic PDEs (Q429474) (← links)
- Adjoint IMEX-based schemes for control problems governed by hyperbolic conservation laws (Q429475) (← links)
- Adaptive and nonadaptive approaches to statistically based methods for solving stochastic linear programs: a computational investigation (Q429477) (← links)
- On the local convergence of a derivative-free algorithm for least-squares minimization (Q429479) (← links)
- Matrix-free interior point method (Q429480) (← links)
- Capital rationing problems under uncertainty and risk (Q429488) (← links)
- On the effectiveness of projection methods for convex feasibility problems with linear inequality constraints (Q429491) (← links)
- Using approximate secant equations in limited memory methods for multilevel unconstrained optimization (Q429494) (← links)
- A DC programming approach for solving the symmetric eigenvalue complementarity problem (Q429495) (← links)
- Augmented Lagrangian method with nonmonotone penalty parameters for constrained optimization (Q429499) (← links)
- Parameter identification in financial market models with a feasible point SQP algorithm (Q429503) (← links)
- A constraint-reduced variant of Mehrotra's predictor-corrector algorithm (Q429507) (← links)
- Heuristics for a project management problem with incompatibility and assignment costs (Q429511) (← links)
- Inexact trust region PGC method for large sparse unconstrained optimization (Q429517) (← links)
- Generating equidistant representations in biobjective programming (Q429518) (← links)
- How good are extrapolated bi-projection methods for linear feasibility problems? (Q429520) (← links)
- A benchmark library and a comparison of heuristic methods for the linear ordering problem (Q429522) (← links)
- Propagation of data error and parametric sensitivity in computable general equilibrium models (Q429534) (← links)
- Heuristic optimization methods for dynamic panel data model selection: application on the Russian innovative performance (Q429539) (← links)
- Exploring US business cycles with bivariate loops using penalized spline regression (Q429548) (← links)
- Model evolution with equality -- revised and implemented (Q429586) (← links)
- Incremental variable splitting (Q429591) (← links)
- On the verification of security-aware E-services (Q429592) (← links)
- Projection and scope-determined circumscription (Q429594) (← links)
- \(\lim +, \delta^+\), and non-permutability of \(\beta\)-steps (Q429596) (← links)
- A periodic Levinson-Durbin algorithm for entropy maximization (Q429609) (← links)
- Coordinate ascent for penalized semiparametric regression on high-dimensional panel count data (Q429611) (← links)
- Robust joint modeling of mean and dispersion through trimming (Q429614) (← links)
- Bayesian multiscale analysis of images modeled as Gaussian Markov random fields (Q429618) (← links)
- Random effects in promotion time cure rate models (Q429623) (← links)
- On generalised asymmetric stochastic volatility models (Q429633) (← links)
- Cardinality constrained combinatorial optimization: complexity and polyhedra (Q429646) (← links)
- Complexity results for weighted timed event graphs (Q429654) (← links)
- A general VNS heuristic for the traveling salesman problem with time windows (Q429659) (← links)
- The delivery man problem with time windows (Q429673) (← links)
- Information-theoretic approaches to branching in search (Q429675) (← links)
- Using Markov chains to analyze the effectiveness of local search algorithms (Q429676) (← links)
- A polyhedral study on \(0\)-\(1\) knapsack problems with disjoint cardinality constraints: facet-defining inequalities by sequential lifting (Q429688) (← links)
- Cutting stock with no three parts per pattern: work-in-process and pattern minimization (Q429692) (← links)
- Quantum annealing of the graph coloring problem (Q429697) (← links)
- Higher weights for codes over rings (Q429748) (← links)
- Complexity bounds for the rational Newton-Puiseux algorithm over finite fields (Q429752) (← links)
- Two kinds of division polynomials for twisted Edwards curves (Q429775) (← links)
