Branching on hyperplane methods for mixed integer linear and convex programming using adjoint lattices

ISSN： 0925-5001

Source： Journal of Global Optimization, Vol.49, Iss.4, 2011-04, pp. : 623-649

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Three-Dimensional Path Planning of a Climbing Robot Using Mixed Integer Linear Programming

By Yue Ronggang Xiao Jizhong Wang Shaoping Joseph Samleo L.

Advanced Robotics, Vol. 24, Iss. 15, 2010-11 ,pp. : 2087-2118

Taylor & Francis Ltd

Access to resources Recommend Favorite

An Algorithm for the Solution of Multiparametric Mixed Integer Linear Programming Problems

By Dua V. Pistikopoulos E.N.

Annals of Operations Research, Vol. 99, Iss. 1-4, 2000-12 ,pp. : 123-139

Springer Publishing Company

Access to resources Recommend Favorite

A flexible platform for mixed-integer non-linear programming problems

By Östermark Ralf

Kybernetes: The International Journal of Systems & Cybernetics, Vol. 36, Iss. 5-6, 2007-06 ,pp. : 652-670

Emerald Group Publishing Ltd

Access to resources Recommend Favorite

Concurrent processing of mixed-integer non-linear programming problems

By Östermark Ralf

Kybernetes: The International Journal of Systems & Cybernetics, Vol. 38, Iss. 6, 2009-01 ,pp. : 966-989

Emerald Group Publishing Ltd

Access to resources Recommend Favorite

Mixed Integer Linear Programming in Process Scheduling: Modeling, Algorithms, and Applications

By Floudas Christodoulos Lin Xiaoxia

Annals of Operations Research, Vol. 139, Iss. 1, 2005-10 ,pp. : 131-162

Springer Publishing Company

Access to resources Recommend Favorite