An Integer Linear Programming Formulation for the Minimum Cardinality Segmentation Problem

Author： Catanzaro Daniele   Engelbeen Céline  

Publisher： MDPI

E-ISSN： 1999-4893|8|4|999-1020

ISSN： 1999-4893

Source： Algorithms, Vol.8, Iss.4, 2015-11, pp. : 999-1020

Access to resources Favorite

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

Mammographic Segmentation Using WaveCluster

By Barnathan Michael  

Algorithms, Vol. 5, Iss. 3, 2012-08 ,pp. : 318-329

MDPI

Access to resources Recommend Favorite

Approximating the Minimum Tour Cover of a Digraph

By Nguyen Viet Hung  

Algorithms, Vol. 4, Iss. 1, 2011-04 ,pp. : 75-86

MDPI

Access to resources Recommend Favorite

Educational Programming on the Raspberry Pi

By Kölling Michael  

Electronics, Vol. 5, Iss. 3, 2016-06 ,pp. : 33-33

MDPI

Access to resources Recommend Favorite

Operational Solution of Non-Integer Ordinary and Evolution-Type Partial Differential Equations

By Zhukovsky Konstantin V.   Srivastava Hari M.  

Axioms, Vol. 5, Iss. 4, 2016-12 ,pp. : 29-29

MDPI

Access to resources Recommend Favorite

Segmentation and Shape Analysis of Macrophages Using Anglegram Analysis †

By Solís-Lemus José Alonso   Stramer Brian   Slabaugh Greg   Reyes-Aldasoro Constantino Carlos  

Journal of Imaging, Vol. 4, Iss. 1, 2017-12 ,pp. : 2-2

MDPI

Access to resources Recommend Favorite