0-1 Integer Programming
0-1 Integer Programming is a type of integer programming in which the decision variables are restricted to binary values, taking on only 0 or 1, thereby modeling problems involving yes-no decisions.
375
Publications
22.4K
Citations
807
Authors
415
Institutions
Publications per year
2017–2026
49
Variants
Binary Integer ProgrammingBinary Programming
Parents
375
P-Complete Approximation Problems
Sartaj Sahni, Teofilo F. Gonzalez · Journal of the ACM · 1976 · 1.7K citations · Full text
1–5 of 375
807
8
h-index
8
h-index
Laboratoire d'Automatique, de Mécanique et d'Informatique Industrielles et Humaines, France
7 publications · 285 citations
7
h-index
6
h-index
5
h-index
1–5 of 807
415
Carnegie Mellon University
Pittsburgh, United States
13 h-index
21 publications
2.9K citations

Centre National de la Recherche Scientifique
Paris, France
11 h-index
20 publications
1.2K citations
Georgia Institute of Technology
Atlanta, United States
10 h-index
19 publications
1.9K citations
Laboratoire d'Automatique, de Mécanique et d'Informatique Industrielles et Humaines
Valenciennes, France
9 h-index
15 publications
1K citations
University of Michigan
Ann Arbor, United States
9 h-index
23 publications
1.2K citations

Université Polytechnique Hauts-de-France
Valenciennes, France
9 h-index
15 publications
643 citations

University of Bologna
Bologna, Italy
6 h-index
10 publications
1.7K citations
Virginia Tech
Blacksburg, United States
6 h-index
8 publications
260 citations
1–8 of 415
35 publications · 2.4K citations
25
h-index
23 publications · 1.8K citations
18
h-index
19 publications · 2.7K citations
17
h-index
12 publications · 1.7K citations
11
h-index
9 publications · 466 citations
9
h-index
1–5