The following pages link to (Q3818127):
Displaying 28 items.
- Planning and acting in partially observable stochastic domains (Q72343) (← links)
- On the diameter of lattice polytopes (Q282757) (← links)
- Minimal counterexamples for linear-time probabilistic verification (Q402125) (← links)
- On the finite convergence of interior-point algorithms for linear programming (Q687096) (← links)
- Non-standard approaches to integer programming (Q697562) (← links)
- On convergence in mixed integer programming (Q715071) (← links)
- Strong LP formulations for scheduling splittable jobs on unrelated machines (Q896269) (← links)
- Reverse split rank (Q896287) (← links)
- A note on a theorem of Blum, Shub, and Smale (Q909656) (← links)
- Scheduling internal audit activities: a stochastic combinatorial optimization problem (Q975756) (← links)
- A new constraint-based description of the steady-state flux cone of metabolic networks (Q1026181) (← links)
- Generalized polymatroids and submodular flows (Q1116889) (← links)
- Expressing combinatorial optimization problems by linear programs (Q1186549) (← links)
- Approximate Farkas lemmas and stopping rules for iterative infeasible-point algorithms for linear programming (Q1290596) (← links)
- Auditing Boolean attributes (Q1394802) (← links)
- New techniques for linear arithmetic: cubes and equalities (Q1688532) (← links)
- Certificates of optimality for mixed integer linear programming using generalized subadditive generator functions (Q1748494) (← links)
- Learning from rounded-off data. (Q1873753) (← links)
- An algebraic geometry algorithm for scheduling in presence of setups and correlated demands (Q1906277) (← links)
- Reverse search for enumeration (Q1917258) (← links)
- Mixed-volume computation by dynamic lifting applied to polynomial system solving (Q1921341) (← links)
- Frustrated two dimensional quantum magnets (Q2405339) (← links)
- A polynomial time algorithm for read-once certification of linear infeasibility in UTVPI constraints (Q2415363) (← links)
- Integer linear programming as a tool for constructing trees from quartet data (Q2500302) (← links)
- Integer Programming: Optimization and Evaluation Are Equivalent (Q3183481) (← links)
- Artifact-Free Variational MPEG Decompression (Q3300301) (← links)
- Relaxations of mixed integer sets from lattice-free polyhedra (Q5894789) (← links)
- On computing Hilbert bases via the Elliot--MacMahon algorithm (Q5941500) (← links)
