scientific article; zbMATH DE number 5485471
From MaRDI portal
Publication:3549634
Deterministic network models in operations research (90B10) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Resource and cost allocation (including fair division, apportionment, etc.) (91B32) General equilibrium theory (91B50)
Cited in
(18)- A branch-and-bound algorithm for a class of mixed integer linear maximum multiplicative programs: a bi-objective optimization approach
- A linear programming based algorithm to solve a class of optimization problems with a multi-linear objective function and affine constraints
- Equivalence of convex minimization problems over base polytopes
- ReGale: some memorable results
- How to allocate goods in an online market?
- Exact solution approaches for integer linear generalized maximum multiplicative programs through the lens of multi-objective optimization
- Efficient advert assignment
- The core of the participatory budgeting problem
- Theory of principal partitions revisited
- A Criterion Space Branch-and-Cut Algorithm for Mixed Integer Bilinear Maximum Multiplicative Programs
- Fair packing and covering on a relative scale
- Proportional response dynamics in the Fisher market
- A criterion space search algorithm for mixed integer linear maximum multiplicative programs: a multiobjective optimization approach
- Strategy-proof budgeting via a VCG-like mechanism
- Strategy-proof budgeting via a VCG-like mechanism
- A criterion space search feasibility pump heuristic for solving maximum multiplicative programs
- On stability and learning of competitive equilibrium in generalized Fisher market models: a variational inequality approach
- On competitiveness in uniform utility allocation markets
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3549634)
