A computational study of the pseudo-Boolean approach to the p-median problem applied to cell formation

B. Goldengorin; D. Krushynskyi

doi:10.1007/978-3-642-21527-8_55

A computational study of the pseudo-Boolean approach to the p-median problem applied to cell formation

B. Goldengorin, D. Krushynskyi

Operations, Planning, Accounting, and Control

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

6 Citations (Scopus)

Abstract

In this study we show by means of computational experiments that a pseudo-Boolean approach leads to a very compact presentation of p-Median problem instances which might be solved to optimality by a general purpose solver like CPLEX, Xpress, etc. Together with p-Median benchmark instances from OR and some other libraries we are able to solve to optimality many benchmark instances from cell formation in group technology which were tackled in the past only by means of different types of heuristics. Finally, we show that this approach is flexible to take into account many other practically motivated constraints in cell formation.

Original language	English
Title of host publication	Network Optimization : 5th International Conference, INOC 201, Hamburg, Germany, June 13-16, 2011, Proceedings
Editors	J. Pahl, T. Reiners, S. Voß
Place of Publication	Berlin
Publisher	Springer
Pages	503-516
ISBN (Print)	978-3-642-21526-1
DOIs	https://doi.org/10.1007/978-3-642-21527-8_55
Publication status	Published - 2011
Event	conference; 5th International Network Optimization Conference (INOC 2011); 2011-06-13; 2011-06-16 - Duration: 13 Jun 2011 → 16 Jun 2011

Publication series

Name	Lecture Notes in Computer Science
Volume	6701
ISSN (Print)	0302-9743

Conference

Conference	conference; 5th International Network Optimization Conference (INOC 2011); 2011-06-13; 2011-06-16
Period	13/06/11 → 16/06/11
Other	5th International Network Optimization Conference (INOC 2011)

Access to Document

10.1007/978-3-642-21527-8_55

Fingerprint Dive into the research topics of 'A computational study of the pseudo-Boolean approach to the p-median problem applied to cell formation'. Together they form a unique fingerprint.

Cite this

Goldengorin, B., & Krushynskyi, D. (2011). A computational study of the pseudo-Boolean approach to the p-median problem applied to cell formation. In J. Pahl, T. Reiners, & S. Voß (Eds.), Network Optimization : 5th International Conference, INOC 201, Hamburg, Germany, June 13-16, 2011, Proceedings (pp. 503-516). (Lecture Notes in Computer Science; Vol. 6701). Springer. https://doi.org/10.1007/978-3-642-21527-8_55

@inproceedings{08d5db6be9e3423284b1aa6f69307086,

title = "A computational study of the pseudo-Boolean approach to the p-median problem applied to cell formation",

abstract = "In this study we show by means of computational experiments that a pseudo-Boolean approach leads to a very compact presentation of p-Median problem instances which might be solved to optimality by a general purpose solver like CPLEX, Xpress, etc. Together with p-Median benchmark instances from OR and some other libraries we are able to solve to optimality many benchmark instances from cell formation in group technology which were tackled in the past only by means of different types of heuristics. Finally, we show that this approach is flexible to take into account many other practically motivated constraints in cell formation.",

author = "B. Goldengorin and D. Krushynskyi",

year = "2011",

doi = "10.1007/978-3-642-21527-8_55",

language = "English",

isbn = "978-3-642-21526-1",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

pages = "503--516",

editor = "J. Pahl and T. Reiners and S. Vo{\ss}",

booktitle = "Network Optimization : 5th International Conference, INOC 201, Hamburg, Germany, June 13-16, 2011, Proceedings",

address = "Germany",

note = "conference; 5th International Network Optimization Conference (INOC 2011); 2011-06-13; 2011-06-16 ; Conference date: 13-06-2011 Through 16-06-2011",

}

Goldengorin, B & Krushynskyi, D 2011, A computational study of the pseudo-Boolean approach to the p-median problem applied to cell formation. in J Pahl, T Reiners & S Voß (eds), Network Optimization : 5th International Conference, INOC 201, Hamburg, Germany, June 13-16, 2011, Proceedings. Lecture Notes in Computer Science, vol. 6701, Springer, Berlin, pp. 503-516, conference; 5th International Network Optimization Conference (INOC 2011); 2011-06-13; 2011-06-16, 13/06/11. https://doi.org/10.1007/978-3-642-21527-8_55

A computational study of the pseudo-Boolean approach to the p-median problem applied to cell formation. / Goldengorin, B.; Krushynskyi, D.

Network Optimization : 5th International Conference, INOC 201, Hamburg, Germany, June 13-16, 2011, Proceedings. ed. / J. Pahl; T. Reiners; S. Voß. Berlin : Springer, 2011. p. 503-516 (Lecture Notes in Computer Science; Vol. 6701).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

TY - GEN

T1 - A computational study of the pseudo-Boolean approach to the p-median problem applied to cell formation

AU - Goldengorin, B.

AU - Krushynskyi, D.

PY - 2011

Y1 - 2011

N2 - In this study we show by means of computational experiments that a pseudo-Boolean approach leads to a very compact presentation of p-Median problem instances which might be solved to optimality by a general purpose solver like CPLEX, Xpress, etc. Together with p-Median benchmark instances from OR and some other libraries we are able to solve to optimality many benchmark instances from cell formation in group technology which were tackled in the past only by means of different types of heuristics. Finally, we show that this approach is flexible to take into account many other practically motivated constraints in cell formation.

AB - In this study we show by means of computational experiments that a pseudo-Boolean approach leads to a very compact presentation of p-Median problem instances which might be solved to optimality by a general purpose solver like CPLEX, Xpress, etc. Together with p-Median benchmark instances from OR and some other libraries we are able to solve to optimality many benchmark instances from cell formation in group technology which were tackled in the past only by means of different types of heuristics. Finally, we show that this approach is flexible to take into account many other practically motivated constraints in cell formation.

U2 - 10.1007/978-3-642-21527-8_55

DO - 10.1007/978-3-642-21527-8_55

M3 - Conference contribution

SN - 978-3-642-21526-1

T3 - Lecture Notes in Computer Science

SP - 503

EP - 516

BT - Network Optimization : 5th International Conference, INOC 201, Hamburg, Germany, June 13-16, 2011, Proceedings

A2 - Pahl, J.

A2 - Reiners, T.

A2 - Voß, S.

PB - Springer

CY - Berlin

T2 - conference; 5th International Network Optimization Conference (INOC 2011); 2011-06-13; 2011-06-16

Y2 - 13 June 2011 through 16 June 2011

ER -

Goldengorin B, Krushynskyi D. A computational study of the pseudo-Boolean approach to the p-median problem applied to cell formation. In Pahl J, Reiners T, Voß S, editors, Network Optimization : 5th International Conference, INOC 201, Hamburg, Germany, June 13-16, 2011, Proceedings. Berlin: Springer. 2011. p. 503-516. (Lecture Notes in Computer Science). https://doi.org/10.1007/978-3-642-21527-8_55