Quadratic integer programming with application to the chaotic mappings of complete multipartite graphs.

DOI10.1023/A:1017584227417zbMath1064.90028OpenAlexW1486446192MaRDI QIDQ5958088

No author found.

Publication date: 2001

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1017584227417

zbMATH Keywords

optimal solutionChaotic mappingcomplete multipartite graphquadratic integer programming

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Integer programming (90C10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (7)

Chaotic numbers of complete bipartite graphs and tripartite graphs ⋮ An efficient compact quadratic convex reformulation for general integer quadratic programs ⋮ Near automorphisms of complement or square of a path ⋮ Extending the QCR method to general mixed-integer programs ⋮ Near automorphisms of cycles ⋮ A branch and bound algorithm for general mixed-integer quadratic programs based on quadratic convex relaxation ⋮ Linear Reformulations of Integer Quadratic Programs

Cites Work

• Unnamed Item
• Arranging \(n\) distinct numbers on a line or a circle to reach extreme total variations
• Total relative displacement of permutations
• Extremal permutations with respect to weak majorizations

This page was built for publication: Quadratic integer programming with application to the chaotic mappings of complete multipartite graphs.