A new complexity result on multiobjective linear integer programming using short rational generating functions
From MaRDI portal
Publication:691389
DOI10.1007/s11590-011-0279-1zbMath1258.90060OpenAlexW2067420962WikidataQ58217165 ScholiaQ58217165MaRDI QIDQ691389
Publication date: 30 November 2012
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-011-0279-1
Integer programming (90C10) Abstract computational complexity for mathematical programming problems (90C60) Multi-objective and goal programming (90C29)
Related Items
Branch-and-Bound for Biobjective Mixed-Integer Linear Programming ⋮ Short rational generating functions for solving some families of fuzzy integer programming problems ⋮ A mathematical programming approach to the computation of the omega invariant of a numerical semigroup
Cites Work
- Unnamed Item
- Unnamed Item
- A stochastic bi-objective location model for strategic reverse logistics
- The multicriteria big cube small cube method
- Some algebraic methods for solving multiobjective polynomial integer programs
- Pareto optimality, game theory and equilibria
- Multiple criteria optimization: State of the art annotated bibliographic surveys
- Multiobjective solution of the uncapacitated plant location problem
- Generating functions and duality for integer programs
- Heuristic for a new multiobjective scheduling problem
- A survey of recent developments in multiobjective optimization
- Handbook of multicriteria analysis
- A computational study of integer programming algorithms based on Barvinok's rational functions
- Short rational functions for toric algebra and applications
- Pareto Optima of Multicriteria Integer Linear Programs
- A Survey of Multiple Criteria Integer Programming Methods
- Partial Gröbner Bases for Multiobjective Integer Linear Optimization
- Points entiers dans les polyèdres convexes
- Short rational generating functions for lattice point problems
- A Polynomial Time Algorithm for Counting Integral Points in Polyhedra When the Dimension is Fixed