Greedy systems of linear inequalities and lexicographically optimal solutions

DOI10.1051/ro/2019001zbMath1430.90398OpenAlexW2907845077MaRDI QIDQ5214340

Satoru Fujishige

Publication date: 7 February 2020

Published in: RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/2433/244873

zbMATH Keywords

discrete convexitylexicographic optimalityintegrally convex functionsgreedy system

Mathematics Subject Classification ID

Optimality conditions and duality in mathematical programming (90C46) Linear programming (90C05) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items

Recent progress on integrally convex functions, Discrete 2-convex functions

Cites Work

• Strongly polynomial and fully combinatorial algorithms for bisubmodular function minimization
• Pseudomatroids
• Submodular functions and optimization
• On structures of bisubmodular polyhedra
• A characterization of bisubmodular functions
• Integrality of subgradients and biconjugates of integrally convex functions
• A greedy algorithm for solving a certain class of linear programmes
• Discrete Convex Analysis
• Discrete Convex Functions on Graphs and Their Algorithmic Applications
• Delta-Matroids, Jump Systems, and Bisubmodular Polyhedra
• Relationship of M-/L-convex functions with discrete convex functions by Miller and Favati-Tardella.