The following pages link to (Q3818127):
Displaying 50 items.
- Planning and acting in partially observable stochastic domains (Q72343) (← links)
- Optimal affine leader functions in reverse Stackelberg games. Existence conditions and characterization (Q255113) (← links)
- The projected faces property and polyhedral relations (Q263204) (← links)
- Optimality of the neighbor joining algorithm and faces of the balanced minimum evolution polytope (Q263784) (← links)
- Sums of idempotents and logarithmic residues in zero pattern matrix algebras (Q269278) (← links)
- On polynomial kernels for sparse integer linear programs (Q269481) (← links)
- Constraint satisfaction and semilinear expansions of addition over the rationals and the reals (Q269512) (← links)
- Feature selection with SVD entropy: some modification and extension (Q278695) (← links)
- On the diameter of lattice polytopes (Q282757) (← links)
- A heuristic prover for real inequalities (Q287379) (← links)
- Zero sum sign-central matrices and applications (Q290660) (← links)
- Computing assortative mixing by degree with the \(s\)-metric in networks using linear programming (Q305479) (← links)
- Homometry and direct-sum decompositions of lattice-convex sets (Q306515) (← links)
- Effective estimates on integral quadratic forms: Masser's conjecture, generators of orthogonal groups, and bounds in reduction theory (Q311145) (← links)
- Individuals, populations and fluid approximations: a Petri net based perspective (Q313335) (← links)
- Labeled cuts in graphs (Q313962) (← links)
- A Benders decomposition-based matheuristic for the cardinality constrained shift design problem (Q323346) (← links)
- Integer decomposition property of free sums of convex polytopes (Q331499) (← links)
- Optimistic optimization for model predictive control of \(\max\)-plus linear systems (Q340616) (← links)
- On the number of irreducible points in polyhedra (Q343724) (← links)
- Extended formulations for independence polytopes of regular matroids (Q343749) (← links)
- What makes a \(\mathbf D_0\) graph Schur positive? (Q345152) (← links)
- Gröbner bases and their application to the Cauchy problem on finitely generated affine monoids (Q346555) (← links)
- Cycle-based reducibility of multi-index transport-type systems of linear inequalities (Q357096) (← links)
- Constructive proofs of some positivstellensätze for compact semialgebraic subsets of \(\mathbb R^{d }\) (Q368724) (← links)
- Scaling invariants and symmetry reduction of dynamical systems (Q372874) (← links)
- Testing additive integrality gaps (Q378120) (← links)
- Some properties of convex hulls of integer points contained in general convex sets (Q378131) (← links)
- On total unimodularity of edge-edge adjacency matrices (Q378224) (← links)
- Shrinking of time Petri nets (Q378906) (← links)
- Comments on: Recent progress on the combinatorial diameter of polytopes and simplicial complexes (Q384507) (← links)
- A characterization of saturated designs for factorial experiments (Q389314) (← links)
- Dominating functions and total dominating functions of countable graphs (Q389474) (← links)
- Minimal counterexamples for linear-time probabilistic verification (Q402125) (← links)
- Non-normal very ample polytopes and their holes (Q405151) (← links)
- On mixed-integer sets with two integer variables (Q408383) (← links)
- A characterization of uniform matroids (Q415778) (← links)
- Algebraic combinatorics of diametric magic circles (Q417955) (← links)
- Packing cycles exactly in polynomial time (Q421271) (← links)
- Hermite normal forms and \(\delta \)-vectors (Q423636) (← links)
- Polytope-based computation of polynomial ranges (Q426184) (← links)
- Two complexity results on \(c\)-optimality in experimental design (Q429521) (← links)
- Strengthening lattice-free cuts using non-negativity (Q429683) (← links)
- Computing Gröbner bases of pure binomial ideals via submodules of \(\mathbb Z^n\) (Q432760) (← links)
- Abstract interpretation meets convex optimization (Q435969) (← links)
- Decidability and combination results for two notions of knowledge in security protocols (Q437043) (← links)
- An interpolating sequent calculus for quantifier-free Presburger arithmetic (Q438556) (← links)
- Monotone optimal control for a class of Markov decision processes (Q439381) (← links)
- Feasibility in reverse convex mixed-integer programming (Q439456) (← links)
- Split cuts for robust mixed-integer optimization (Q439905) (← links)
