Optimality criterion for a class of nonlinear integer programs.
From MaRDI portal
Publication:703262
DOI10.1016/J.ORL.2003.11.007zbMATH Open1054.90049OpenAlexW2063755475MaRDI QIDQ703262FDOQ703262
Authors: Kazuo Murota, Hiroo Saito, Robert Weismantel 
Publication date: 11 January 2005
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2003.11.007
Recommendations
- The quadratic Graver cone, quadratic integer minimization, and extensions
- Nonlinear discrete optimization. An algorithmic theory
- Global optimality conditions for some classes of polynomial integer programming problems
- On the greedy solution in integer linear programming
- Partial Gröbner bases for multiobjective integer linear optimization
Cites Work
- Title not available (Why is that?)
- On the foundations of linear and integer linear programming I
- Optimality criterion for a class of nonlinear integer programs.
- A primal all-integer algorithm based on irreducible solutions
- Title not available (Why is that?)
- Test sets of integer programs
- Title not available (Why is that?)
Cited In (10)
- Graver basis and proximity techniques for block-structured separable convex integer minimization problems
- Lower bounds on the graver complexity of \(M\)-fold matrices
- A polynomial oracle-time algorithm for convex integer minimization
- Optimality criterion for a class of nonlinear integer programs.
- Comment on A nonlinear Lagrangian dual for integer programming.
- Cone superadditivity of discrete convex functions
- Vector and matrix apportionment problems and separable convex integer optimization
- On test sets for nonlinear integer maximization
- \(n\)-fold integer programming in cubic time
- La valeur optimale des programmes entiers. (The optimal value of integer programs)
This page was built for publication: Optimality criterion for a class of nonlinear integer programs.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q703262)
