A new complexity result on multiobjective linear integer programming using short rational generating functions

DOI10.1007/S11590-011-0279-1MaRDI QIDQ691389zbMATH OpenOpenAlexWikidataFDO

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

zbMATH Keywords

multiple objective optimizationshort rational generating functions

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Integer programming (90C10) Abstract computational complexity for mathematical programming problems (90C60)

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

Cites work

• scientific article; zbMATH DE number 51430 (Why is no real title available?)
• scientific article; zbMATH DE number 915988 (Why is no real title available?)
• A Polynomial Time Algorithm for Counting Integral Points in Polyhedra When the Dimension is Fixed
• A Survey of Multiple Criteria Integer Programming Methods
• A computational study of integer programming algorithms based on Barvinok's rational functions
• A stochastic bi-objective location model for strategic reverse logistics
• A survey of recent developments in multiobjective optimization
• Generating functions and duality for integer programs
• Handbook of multicriteria analysis
• Heuristic for a new multiobjective scheduling problem
• Multiobjective solution of the uncapacitated plant location problem
• Multiple criteria optimization: State of the art annotated bibliographic surveys
• Pareto optima of multicriteria integer linear programs
• Pareto optimality, game theory and equilibria
• Partial Gröbner bases for multiobjective integer linear optimization
• Points entiers dans les polyèdres convexes
• Short rational functions for toric algebra and applications
• Short rational generating functions for lattice point problems
• Some algebraic methods for solving multiobjective polynomial integer programs
• The multicriteria big cube small cube method

Cited in

(3)

• Branch-and-Bound for Biobjective Mixed-Integer Linear Programming
• A mathematical programming approach to the computation of the omega invariant of a numerical semigroup
• Short rational generating functions for solving some families of fuzzy integer programming problems

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)