The trouble with the second quantifier
From MaRDI portal
Publication:2044549
DOI10.1007/s10288-021-00477-yzbMath1473.90146OpenAlexW3159886842MaRDI QIDQ2044549
Publication date: 9 August 2021
Published in: 4OR (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10288-021-00477-y
Abstract computational complexity for mathematical programming problems (90C60) Combinatorial optimization (90C27)
Related Items (4)
Computing equilibria for integer programming games ⋮ Simple voting games and cartel damage proportioning ⋮ On the complexity of robust multi-stage problems with discrete recourse ⋮ Rejection-proof mechanisms for multi-agent kidney exchange
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Dimension of the Lisbon voting rules in the EU council: a challenge and new world record
- Pinpointing the complexity of the interval min-max regret knapsack problem
- Complexity of clique coloring and related problems
- Bilevel programming: a survey
- Min-max and min-max regret versions of combinatorial optimization problems: A survey
- Some results on \((a:b)\)-choosability
- Lattice translates of a polytope and the Frobenius problem
- Weighted voting, multicameral representation, and power
- On defining sets of vertices of the hypercube by linear inequalities
- The polynomial-time hierarchy
- Robust discrete optimization and its applications
- Foundations of bilevel programming
- Complexity of the Frobenius problem
- A hardness result for core stability in additive hedonic games
- Lower bounds and a new exact approach for the Bilevel Knapsack with Interdiction Constraints
- Core in a simple coalition formation game
- On the dimension of simple monotonic games
- On core membership testing for hedonic coalition formation games
- Core Stability in Hedonic Coalition Formation
- Bilevel Knapsack with Interdiction Constraints
- A Study on the Computational Complexity of the Bilevel Knapsack Problem
- The polynomial hierarchy and a simple model for competitive analysis
- On the symmetric travelling salesman problem: Solution of a 120-city problem
- Well-Solvable Special Cases of the Traveling Salesman Problem: A Survey
- Sometimes Travelling is Easy: The Master Tour Problem
- A New General-Purpose Algorithm for Mixed-Integer Bilevel Linear Programs
- Annotated Bibliography on Bilevel Programming and Mathematical Programs with Equilibrium Constraints
- Edgeconvex Circuits and the Traveling Salesman Problem
- Computational Complexity
- Nombre chromatique et plus longs chemins d'un graphe
- Zur algebraischen Begründung der Graphentheorie. I
- College Admissions and the Stability of Marriage
- Bilevel Programming: The Montreal School
This page was built for publication: The trouble with the second quantifier
