Theory of linear and integer programming
Theory of linear and integer programming
Integer and combinatorial optimization
Integer and combinatorial optimization
Parametric Dispatching of Hard Real-Time Tasks
IEEE Transactions on Computers
A Specification Framework for Real-Time Scheduling
SOFSEM '02 Proceedings of the 29th Conference on Current Trends in Theory and Practice of Informatics: Theory and Practice of Informatics
Duality in the parametric polytope and its applications to a scheduling problem
Duality in the parametric polytope and its applications to a scheduling problem
Periodic Linear Programming with applications to real-time scheduling
Mathematical Structures in Computer Science
An empirical analysis of algorithms for partially Clairvoyant scheduling
International Journal of Parallel, Emergent and Distributed Systems
Out of order quantifier elimination for Standard Quantified Linear Programs
Journal of Symbolic Computation
Zero-Clairvoyant scheduling with inter-period constraints
ASIAN'04 Proceedings of the 9th Asian Computing Science conference on Advances in Computer Science: dedicated to Jean-Louis Lassez on the Occasion of His 5th Cycle Birthday
| Hi-index | 0.00 |
Quantified Linear Programming is the problem of checking whether a polyhedron specified by a linear system of inequalities is nonempty, with respect to a specified quantifier string. Quantified Linear Programming subsumes traditional Linear Programming, since in traditional Linear Programming, all the program variables are existentially quantified (implicitly), whereas, in Quantified Linear Programming, a program variable may be existentially quantified or universally quantified over a continuous range. On account of the alternation of quantifiers in the specification of a Quantified Linear Program (QLP), this problem is non-trivial.