Integral simplex methods for the set partitioning problem: globalisation and anti-cycling

DOI10.1007/978-3-319-99142-9_15zbMATH Open1421.90130OpenAlexW2902088816MaRDI QIDQ2325260

Torbjörn Larsson, Elina Rönnberg

Publication date: 9 September 2019

Full work available at URL: https://doi.org/10.1007/978-3-319-99142-9_15

zbMATH Keywords

set partitioningquasi-integralityintegral simplex methodanti-cycling rules

Mathematics Subject Classification ID

Convex programming (90C25) Integer programming (90C10) Linear programming (90C05) Combinatorial optimization (90C27)

Related Items (1)

Improved integral simplex using decomposition for the set partitioning problem

Recommendations

• Title not available (Why is that?) 👍 👎
• On the efficiency of a global non-differentiable optimization algorithm based on the method of optimal set partitioning 👍 👎
• Improved integral simplex using decomposition for the set partitioning problem 👍 👎
• An integral simplex algorithm for solving combinatorial optimization problems 👍 👎
• Integral simplex using double decomposition for set partitioning problems 👍 👎
• A partitioning algorithm for the mixed integer nonlinear programming problem 👍 👎
• Integral simplex using decomposition for the set partitioning problem 👍 👎
• Metodos Duales y algoritmos hibridos para problemas de «Set Partitioning» 👍 👎
• BRANCH AND BOUND WITH SIMPLICIAL PARTITIONS FOR GLOBAL OPTIMIZATION 👍 👎
• Progress in Artificial Intelligence 👍 👎

This page was built for publication: Integral simplex methods for the set partitioning problem: globalisation and anti-cycling

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