A New Integer Linear Programming Model for the Cutwidth Minimization Problem of a Connected Undirected Graph

López-Locés, Mario C.; Castillo-García, Norberto; Huacuja, Héctor Joaquín Fraire; Bouvry, Pascal; Pecero, Johnatan E.; Rangel, Rodolfo A. Pazos; Barbosa, Juan Javier González; Valdez, Fevrier

doi:10.1007/978-3-319-05170-3_35

Search citation statements

Order By: Relevance

Paper Sections

Select...

Introduction1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2016

2018

Publication Types

Select...

Book2

Article1

Relationship

Self Cite0

Independent3

Authors

Journals

Cited by 3 publications

(1 citation statement)

References 4 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A large number of problems have been formulated as ILP such as Travelling salesman, Vertex Cover and other covering problems, Set Packing and other Packing problems, Max Bisection Minimization problem, Vertex Separation Minimization problem, Cutwidth Minimization Problem, bandwidth minimization problem, MinLA, etc. [5][6][7][8][9][10].…”

Section: Introductionmentioning

confidence: 99%