A new complexity result on multiobjective linear integer programming using short rational generating functions
DOI10.1007/S11590-011-0279-1zbMATH Open1258.90060OpenAlexW2067420962WikidataQ58217165 ScholiaQ58217165MaRDI QIDQ691389FDOQ691389
Authors: Víctor Blanco, Justo Puerto 
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
Recommendations
- Short rational generating functions for solving some families of fuzzy integer programming problems
- Pareto optima of multicriteria integer linear programs
- Multi-objective integer programming: a general approach for generating all non-dominated solutions
- Enumerating the Set of Non-dominated Vectors in Multiple Objective Integer Linear Programming
- Multi-objective integer programming: an improved recursive algorithm
Multi-objective and goal programming (90C29) Integer programming (90C10) Abstract computational complexity for mathematical programming problems (90C60)
Cites Work
- Multiple criteria optimization: State of the art annotated bibliographic surveys
- Points entiers dans les polyèdres convexes
- A survey of recent developments in multiobjective optimization
- Pareto optimality, game theory and equilibria
- A Polynomial Time Algorithm for Counting Integral Points in Polyhedra When the Dimension is Fixed
- Handbook of multicriteria analysis
- A stochastic bi-objective location model for strategic reverse logistics
- Title not available (Why is that?)
- Title not available (Why is that?)
- Heuristic for a new multiobjective scheduling problem
- Short rational generating functions for lattice point problems
- 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
- The multicriteria big cube small cube method
- Some algebraic methods for solving multiobjective polynomial integer programs
- Multiobjective solution of the uncapacitated plant location problem
- Generating functions and duality for integer programs
- A computational study of integer programming algorithms based on Barvinok's rational functions
Cited In (3)
This page was built for publication: A new complexity result on multiobjective linear integer programming using short rational generating functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q691389)
