Solving Linear Programming with Constraints Unknown

DOI10.1007/978-3-662-47672-7_11zbMath1440.90020arXiv1304.1247OpenAlexW2163020700MaRDI QIDQ3448779

Shengyu Zhang, Xiaohui Bei, Ning Chen

Publication date: 27 October 2015

Published in: Automata, Languages, and Programming (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1304.1247

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational aspects related to convexity (52B55) Abstract computational complexity for mathematical programming problems (90C60) Linear programming (90C05) Approximation methods and heuristics in mathematical programming (90C59) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (2)

Solving Linear Programming with Constraints Unknown ⋮ On the complexity of trial and error for constraint satisfaction problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Recognizing Dirichlet tesselations
• A property of convex sets and its application
• Geometric algorithms and combinatorial optimization
• A subexponential bound for linear programming
• Solving Linear Programming with Constraints Unknown
• Linear Programming in Linear Time When the Dimension Is Fixed
• Recognizing Voronoi Diagrams with Linear Programming
• Las Vegas algorithms for linear and integer programming when the dimension is small
• On a Multidimensional Search Technique and Its Application to the Euclidean One-Centre Problem
• Information Collection for Linear Programs with Uncertain Objective Coefficients
• On the Complexity of Trial and Error for Constraint Satisfaction Problems
• Linear programming without the matrix
• On the complexity of trial and error
• On convex cones

This page was built for publication: Solving Linear Programming with Constraints Unknown