The following pages link to (Q3813613):
Displayed 36 items.
- On the complexity of quantified linear systems (Q391791) (← links)
- SIRALINA: Efficient two-steps heuristic for storage optimisation in single period task scheduling (Q411217) (← links)
- A complexity perspective on entailment of parameterized linear constraints (Q487646) (← links)
- Lifting, tilting and fractional programming revisited (Q614041) (← links)
- An eigenstructure assignment approach for constrained linear continuous-time singular systems (Q673443) (← links)
- Polynomial algorithms for LP over a subring of the algebraic integers with applications to LP with circulant matrices (Q687079) (← links)
- A polynomial-time algorithm for computing the yolk in fixed dimension (Q687092) (← links)
- Optimal length resolution refutations of difference constraint systems (Q846163) (← links)
- Computing a quasi-perfect equilibrium of a two-player game (Q847801) (← links)
- Conic mixed-integer rounding cuts (Q847842) (← links)
- Restricted robust uniform matroid maximization under interval uncertainty (Q879971) (← links)
- On integer points in polyhedra: A lower bound (Q1196682) (← links)
- \((A,B)\)-invariance conditions of polyhedral domains for continuous-time systems (Q1306045) (← links)
- Application of the facility location problem to the problem of locating concentrators on an FAA microwave system (Q1339146) (← links)
- Stability and stabilization of delay differential systems (Q1356135) (← links)
- On linear programming and matrix scaling over the algebraic numbers (Q1361844) (← links)
- Modelization of deterministic rational relations (Q1603699) (← links)
- Proof search and co-NP completeness for many-valued logics (Q1697337) (← links)
- A cutting plane algorithm for the unrelated parallel machine scheduling problem (Q1847208) (← links)
- Investment evaluation based on the commerical scope. The production of natural gas (Q1904680) (← links)
- Improved algorithms for optimal length resolution refutation in difference constraint systems (Q1941901) (← links)
- The tropical analogue of the Helton-Nie conjecture is true (Q1994125) (← links)
- On integer closure in a system of unit two variable per inequality constraints (Q2023870) (← links)
- On the parametrized complexity of Read-once refutations in UTVPI+ constraint systems (Q2049975) (← links)
- Analyzing fractional Horn constraint systems (Q2205946) (← links)
- Polynomial time algorithms for optimal length tree-like refutations of linear infeasibility in UTVPI constraints (Q2235285) (← links)
- A combinatorial algorithm for Horn programs (Q2445839) (← links)
- On a decision procedure for quantified linear programs (Q2462634) (← links)
- An analysis of totally clairvoyant scheduling (Q2464437) (← links)
- A zero-space algorithm for negative cost cycle detection in networks (Q2466006) (← links)
- A polynomial time algorithm for Zero-Clairvoyant scheduling (Q2475435) (← links)
- Labelled Calculi for Łukasiewicz Logics (Q3511458) (← links)
- Convex Hull of Arithmetic Automata (Q3522060) (← links)
- Efficient Method for Periodic Task Scheduling with Storage Requirement Minimization (Q5505681) (← links)
- Discrete convexity and equilibria in economies with indivisible goods and money (Q5939410) (← links)
- Integer programming models for round Robin tournaments (Q6113304) (← links)