A fixed point iterative approach to integer programming and its distributed computation

DOI10.1186/S13663-015-0429-8MaRDI QIDQ288180zbMATH OpenOpenAlexWikidataFDO

Authors Chuangyin Dang, Yinyu Ye

Publication date 25 May 2016

Published in Fixed Point Theory and Applications (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1186/s13663-015-0429-8

zbMATH Keywords

linear programminginteger programmingpolytopefixed point iterative methodincreasing mappinginteger or mixed-integer pointself-dual embedding techniqueTarski's fixed point theorem

Mathematics Subject Classification ID

Integer programming (90C10)

Recommendations

• Fast integer programming in fixed dimension
• The problem with integer programming
• On the complexity of an expanded Tarski's fixed point problem under the componentwise ordering
• scientific article; zbMATH DE number 4054939
• Integer Polynomial Optimization in Fixed Dimension

Cites work

• scientific article; zbMATH DE number 1187159 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1234104 (Why is no real title available?)
• scientific article; zbMATH DE number 1131479 (Why is no real title available?)
• 50 Years of Integer Programming 1958-2008
• A Polynomial Time Algorithm for Counting Integral Points in Polyhedra When the Dimension is Fixed
• A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations
• A lattice-theoretical fixpoint theorem and its applications
• A simplicial approach to the determination of an integer point of a simplex
• An Automatic Method of Solving Discrete Programming Problems
• An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm
• An arbitrary starting homotopy-like simplicial algorithm for computing an integer point in a class of polytopes
• Extended GCD and Hermite Normal Form Algorithms via Lattice Basis Reduction
• Factoring polynomials with rational coefficients
• Integer Polynomial Optimization in Fixed Dimension
• Integer Programming with a Fixed Number of Variables
• Neighborhood Systems for Production Sets with Indivisibilities
• Outline of an algorithm for integer solutions to linear programs
• Production Sets with Indivisibilities, Part I: Generalities
• Solving a system of linear Diophantine equations with lower and upper bounds on the variables.
• The Generalized Basis Reduction Algorithm

Cited in

(3)

• Airline disruption management: a literature review and practical challenges
• A Distributed Algorithm for Computing a Common Fixed Point of a Finite Family of Paracontractions
• Fault section location for distribution network based on linear integer programming

This page was built for publication: A fixed point iterative approach to integer programming and its distributed computation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q288180)