Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Pareto Optima of Multicriteria Integer Linear Programs

From MaRDI portal
Publication:2901044
Jump to:navigation, search

DOI10.1287/ijoc.1080.0277zbMath1243.90192arXiv0707.1362OpenAlexW1978087936MaRDI QIDQ2901044

Matthias Köppe, Jesús A. De Loera, Raymond Hemmecke

Publication date: 28 July 2012

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0707.1362

zbMATH Keywords

computational complexityinteger programminganalysis of algorithmsmulticriteria programming


Mathematics Subject Classification ID

Integer programming (90C10) Multi-objective and goal programming (90C29)


Related Items

Polyhedral omega: a new algorithm for solving linear Diophantine systems, Short Presburger Arithmetic Is Hard, Branch-and-Bound for Biobjective Mixed-Integer Linear Programming, A mathematical programming approach to the computation of the omega invariant of a numerical semigroup, Efficient Storage of Pareto Points in Biobjective Mixed Integer Programming, A new complexity result on multiobjective linear integer programming using short rational generating functions, Computation of several power indices by generating functions



Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2901044&oldid=15861377"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 3 February 2024, at 21:10.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki