Polyhedral and algorithmic properties of quantified linear programs

DOI10.1007/978-3-642-15775-2_44zbMATH Open1287.90035OpenAlexW1583189441MaRDI QIDQ3586489FDOQ3586489

Authors: Ulf Lorenz, Alexander Martin, Jan Wolf 

Publication date: 6 September 2010

Published in: Algorithms – ESA 2010 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-15775-2_44

Recommendations

• Quantified linear programs: a computational study
• Solution techniques for quantified linear programs and the links to gaming
• scientific article; zbMATH DE number 2040956
• On a decision procedure for quantified linear programs
• Quantified integer programs with polyhedral uncertainty set

Mathematics Subject Classification ID

Linear programming (90C05) Analysis of algorithms and problem complexity (68Q25) Integer programming (90C10)

Cited In (12)

• Quantified linear programs: a computational study
• On quantified linear implications
• Towards an algorithmic synthesis of thermofluid systems
• On a decision procedure for quantified linear programs
• Multistage robust discrete optimization via quantified integer programming
• Solving multistage quantified linear optimization problems with the alpha-beta nested Benders decomposition
• Title not available (Why is that?)
• Quantified integer programs with polyhedral uncertainty set
• Solution techniques for quantified linear programs and the links to gaming
• Nondegeneracy of polyhedra and linear programs
• Polynomial time certifying algorithms for the planar quantified integer programming problem
• Polyhedral functions and multiparametric linear programming

This page was built for publication: Polyhedral and algorithmic properties of quantified linear programs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3586489)