Algorithmic Applications in Management

DOI10.1007/b137095zbMath1120.90370OpenAlexW2505140176MaRDI QIDQ5710144

Siming Huang

Publication date: 30 November 2005

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b137095

zbMATH Keywords

integer programminginverse problemknapsack problempseudo-polynomial algorithm

Mathematics Subject Classification ID

Integer programming (90C10) Abstract computational complexity for mathematical programming problems (90C60) Combinatorial optimization (90C27) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (6)

Branch-and-bound algorithms for the partial inverse mixed integer linear programming problem ⋮ Inverse multi-objective combinatorial optimization ⋮ The inverse \(\{0,1\}\)-knapsack problem: theory, algorithms and computational experiments ⋮ Inverse integer programming ⋮ Cutting plane algorithms for the inverse mixed integer linear programming problem ⋮ On the Complexity of Inverse Mixed Integer Linear Optimization

This page was built for publication: Algorithmic Applications in Management