On the complexity of inverse bivariate multi-unit assignment valuation problems
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1163110 (Why is no real title available?)
- A first order method for solving convex bilevel optimization problems
- Algorithms for Linear Bilevel Optimization
- Bilevel Optimization of Regularization Hyperparameters in Machine Learning
- Bilevel optimal control: existence results and stationarity conditions
- Bilevel optimization: theory, algorithms, applications and a bibliography
- Characterization and algorithm for bivariate multi-unit assignment valuations
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Computational Difficulties of Bilevel Linear Programming
- Descent approaches for quadratic bilevel programming
- Discrete Convex Analysis
- Inverse problems. Basics, theory and applications in geophysics
- Job Matching, Coalition Formation, and Gross Substitutes
- New Branch-and-Bound Rules for Linear Bilevel Programming
- On an instance of the inverse shortest paths problem
- Solving a bilevel linear program when the inner decision maker control few variables
- The complexity analysis of the inverse center location problem
- The polynomial hierarchy and a simple model for competitive analysis
- Walrasian equilibrium with gross substitutes
- \(M\)-convex function on generalized polymatroid
This page was built for publication: On the complexity of inverse bivariate multi-unit assignment valuation problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6924223)
