DOI: 10.1016/s0167-5060(08)70728-3. Sharp Lower Bounds and Efficient Algorithms for the Simple Plant Location Problem

Sharp Lower Bounds and Efficient Algorithms for the Simple Plant Location Problem

10.1016/s0167-5060(08)70728-3

Crossref book-chapter

Elsevier

Annals of Discrete Mathematics (78)

Bibliography

Bilde, O., & Krarup, J. (1977). Sharp Lower Bounds and Efficient Algorithms for the Simple Plant Location Problem. Studies in Integer Programming, 79â97.

Authors 2

Ole Bilde (first)
Jakob Krarup (additional)

References 18 Referenced 162

10.1287/opre.20.6.1152 / Operations Res. / On the set covering problem by Balas (1972)
10.1287/opre.23.1.74 / Operations Res. / On the set covering problem II. An algorithm for set partitioning by Balas (1975)
{'key': '10.1016/S0167-5060(08)70728-3_bib3', 'series-title': 'Combinatorial Programming: Methods and Applications', 'first-page': '205', 'article-title': 'Set partitioning', 'author': 'Balas', 'year': '1975'} / Combinatorial Programming: Methods and Applications / Set partitioning by Balas (1975)
{'key': '10.1016/S0167-5060(08)70728-3_bib4', 'first-page': '000-000', 'article-title': 'On finding integer solutions to linear programs', 'author': 'Balinski', 'year': '1964', 'journal-title': 'Matematica'} / Matematica / On finding integer solutions to linear programs by Balinski (1964)
{'key': '10.1016/S0167-5060(08)70728-3_bib5', 'series-title': 'Models for capacity planning', 'author': 'Bergendahl', 'year': '1966'} / Models for capacity planning by Bergendahl (1966)
{'key': '10.1016/S0167-5060(08)70728-3_bib6', 'series-title': 'Nonlinear and discrete programming', 'author': 'Bilde', 'year': '1970'} / Nonlinear and discrete programming by Bilde (1970)
{'key': '10.1016/S0167-5060(08)70728-3_bib7', 'series-title': 'Besternmelse of optimal beliggenhed af produktionssteder', 'author': 'Bilde', 'year': '1967'} / Besternmelse of optimal beliggenhed af produktionssteder by Bilde (1967)
{'key': '10.1016/S0167-5060(08)70728-3_bib8', 'series-title': 'Plant location, set covering and economic lot size: an O(mn)-algorithm for structured problems', 'author': 'Bilde', 'year': '1975'} / Plant location, set covering and economic lot size: an O(mn)-algorithm for structured problems by Bilde (1975)
{'key': '10.1016/S0167-5060(08)70728-3_bib9', 'first-page': '163', 'volume': '1', 'author': 'Cornuejols', 'year': '1977', 'journal-title': 'On the uncapacitared location problem, Research Report No. 7602, CORE, Université Catholique de Louvain (1976). Ann. Discrete Math.'} / On the uncapacitared location problem, Research Report No. 7602, CORE, Université Catholique de Louvain (1976). Ann. Discrete Math. by Cornuejols (1977)
10.1287/opre.14.3.361 / Operations Res. / A branch-bound algorithm for plant location by Efroymson (1966)
10.1287/opre.22.2.400 / Operations Res. / Location theory: a selective bibliography by Francis (1974)
10.1287/opre.17.5.848 / Operations Res. / The set partitioning problem: set covering with equality constraints by Garfinkel (1969)
{'key': '10.1016/S0167-5060(08)70728-3_bib13', 'series-title': 'Integer Programming', 'author': 'Garfinkel', 'year': '1972'} / Integer Programming by Garfinkel (1972)
10.1007/BFb0120690 / Math. Programming Study / Lagrangian relaxation for integer programming by Geoffrion (1974)
{'key': '10.1016/S0167-5060(08)70728-3_bib15', 'series-title': 'Complexity of Computer Computations', 'first-page': '85', 'article-title': 'Reducibility among combinatorial problems', 'author': 'Karp', 'year': '1972'} / Complexity of Computer Computations / Reducibility among combinatorial problems by Karp (1972)
10.1287/mnsc.18.12.B718 / Management Sci. / An efficient branch and bound algorithm for the warehouse location problem by Khumawala (1972)
{'key': '10.1016/S0167-5060(08)70728-3_bib17', 'series-title': 'Fixed-cost network flow problems', 'author': 'Krarup', 'year': '1967'} / Fixed-cost network flow problems by Krarup (1967)
10.1287/opre.17.1.85 / Operations Res. / Algorithm for the simple plant-location problem with some side conditions by Spielberg (1969)

Dates

Type	When
Created	17 years, 3 months ago (May 6, 2008, 1:29 p.m.)
Deposited	6 years, 8 months ago (Dec. 28, 2018, 8:27 p.m.)
Indexed	1 month, 4 weeks ago (July 1, 2025, 7:06 a.m.)
Issued	48 years, 7 months ago (Jan. 1, 1977)
Published	48 years, 7 months ago (Jan. 1, 1977)
Published Print	48 years, 7 months ago (Jan. 1, 1977)

Funders 0

None

BibTeX

@inbook{Bilde_1977, title={Sharp Lower Bounds and Efficient Algorithms for the Simple Plant Location Problem}, ISSN={0167-5060}, url={http://dx.doi.org/10.1016/s0167-5060(08)70728-3}, DOI={10.1016/s0167-5060(08)70728-3}, booktitle={Studies in Integer Programming}, publisher={Elsevier}, author={Bilde, Ole and Krarup, Jakob}, year={1977}, pages={79–97} }

JSON

{
  "indexed": {
    "date-parts": [
      [
        2025,
        7,
        1
      ]
    ],
    "date-time": "2025-07-01T11:06:27Z",
    "timestamp": 1751367987175
  },
  "reference-count": 18,
  "publisher": "Elsevier",
  "content-domain": {
    "domain": [],
    "crossmark-restriction": false
  },
  "published-print": {
    "date-parts": [
      [
        1977
      ]
    ]
  },
  "DOI": "10.1016/s0167-5060(08)70728-3",
  "type": "book-chapter",
  "created": {
    "date-parts": [
      [
        2008,
        5,
        6
      ]
    ],
    "date-time": "2008-05-06T17:29:47Z",
    "timestamp": 1210094987000
  },
  "page": "79-97",
  "source": "Crossref",
  "is-referenced-by-count": 162,
  "title": "Sharp Lower Bounds and Efficient Algorithms for the Simple Plant Location Problem",
  "prefix": "10.1016",
  "author": [
    {
      "given": "Ole",
      "family": "Bilde",
      "sequence": "first",
      "affiliation": []
    },
    {
      "given": "Jakob",
      "family": "Krarup",
      "sequence": "additional",
      "affiliation": []
    }
  ],
  "member": "78",
  "reference": [
    {
      "issue": "6",
      "key": "10.1016/S0167-5060(08)70728-3_bib1",
      "doi-asserted-by": "crossref",
      "first-page": "1152",
      "DOI": "10.1287/opre.20.6.1152",
      "article-title": "On the set covering problem",
      "volume": "20",
      "author": "Balas",
      "year": "1972",
      "journal-title": "Operations Res."
    },
    {
      "issue": "1",
      "key": "10.1016/S0167-5060(08)70728-3_bib2",
      "doi-asserted-by": "crossref",
      "first-page": "74",
      "DOI": "10.1287/opre.23.1.74",
      "article-title": "On the set covering problem II. An algorithm for set partitioning",
      "volume": "23",
      "author": "Balas",
      "year": "1975",
      "journal-title": "Operations Res."
    },
    {
      "key": "10.1016/S0167-5060(08)70728-3_bib3",
      "series-title": "Combinatorial Programming: Methods and Applications",
      "first-page": "205",
      "article-title": "Set partitioning",
      "author": "Balas",
      "year": "1975"
    },
    {
      "key": "10.1016/S0167-5060(08)70728-3_bib4",
      "first-page": "000-000",
      "article-title": "On finding integer solutions to linear programs",
      "author": "Balinski",
      "year": "1964",
      "journal-title": "Matematica"
    },
    {
      "key": "10.1016/S0167-5060(08)70728-3_bib5",
      "series-title": "Models for capacity planning",
      "author": "Bergendahl",
      "year": "1966"
    },
    {
      "key": "10.1016/S0167-5060(08)70728-3_bib6",
      "series-title": "Nonlinear and discrete programming",
      "author": "Bilde",
      "year": "1970"
    },
    {
      "key": "10.1016/S0167-5060(08)70728-3_bib7",
      "series-title": "Besternmelse of optimal beliggenhed af produktionssteder",
      "author": "Bilde",
      "year": "1967"
    },
    {
      "key": "10.1016/S0167-5060(08)70728-3_bib8",
      "series-title": "Plant location, set covering and economic lot size: an O(mn)-algorithm for structured problems",
      "author": "Bilde",
      "year": "1975"
    },
    {
      "key": "10.1016/S0167-5060(08)70728-3_bib9",
      "first-page": "163",
      "volume": "1",
      "author": "Cornuejols",
      "year": "1977",
      "journal-title": "On the uncapacitared location problem, Research Report No. 7602, CORE, Universit\u00e9 Catholique de Louvain (1976). Ann. Discrete Math."
    },
    {
      "issue": "3",
      "key": "10.1016/S0167-5060(08)70728-3_bib10",
      "doi-asserted-by": "crossref",
      "first-page": "361",
      "DOI": "10.1287/opre.14.3.361",
      "article-title": "A branch-bound algorithm for plant location",
      "volume": "14",
      "author": "Efroymson",
      "year": "1966",
      "journal-title": "Operations Res."
    },
    {
      "issue": "2",
      "key": "10.1016/S0167-5060(08)70728-3_bib11",
      "doi-asserted-by": "crossref",
      "first-page": "400",
      "DOI": "10.1287/opre.22.2.400",
      "article-title": "Location theory: a selective bibliography",
      "volume": "22",
      "author": "Francis",
      "year": "1974",
      "journal-title": "Operations Res."
    },
    {
      "issue": "5",
      "key": "10.1016/S0167-5060(08)70728-3_bib12",
      "doi-asserted-by": "crossref",
      "first-page": "848",
      "DOI": "10.1287/opre.17.5.848",
      "article-title": "The set partitioning problem: set covering with equality constraints",
      "volume": "17",
      "author": "Garfinkel",
      "year": "1969",
      "journal-title": "Operations Res."
    },
    {
      "key": "10.1016/S0167-5060(08)70728-3_bib13",
      "series-title": "Integer Programming",
      "author": "Garfinkel",
      "year": "1972"
    },
    {
      "key": "10.1016/S0167-5060(08)70728-3_bib14",
      "doi-asserted-by": "crossref",
      "first-page": "82",
      "DOI": "10.1007/BFb0120690",
      "article-title": "Lagrangian relaxation for integer programming",
      "volume": "2",
      "author": "Geoffrion",
      "year": "1974",
      "journal-title": "Math. Programming Study"
    },
    {
      "key": "10.1016/S0167-5060(08)70728-3_bib15",
      "series-title": "Complexity of Computer Computations",
      "first-page": "85",
      "article-title": "Reducibility among combinatorial problems",
      "author": "Karp",
      "year": "1972"
    },
    {
      "issue": "12",
      "key": "10.1016/S0167-5060(08)70728-3_bib16",
      "doi-asserted-by": "crossref",
      "first-page": "B718",
      "DOI": "10.1287/mnsc.18.12.B718",
      "article-title": "An efficient branch and bound algorithm for the warehouse location problem",
      "volume": "18",
      "author": "Khumawala",
      "year": "1972",
      "journal-title": "Management Sci."
    },
    {
      "key": "10.1016/S0167-5060(08)70728-3_bib17",
      "series-title": "Fixed-cost network flow problems",
      "author": "Krarup",
      "year": "1967"
    },
    {
      "issue": "1",
      "key": "10.1016/S0167-5060(08)70728-3_bib18",
      "doi-asserted-by": "crossref",
      "first-page": "85",
      "DOI": "10.1287/opre.17.1.85",
      "article-title": "Algorithm for the simple plant-location problem with some side conditions",
      "volume": "17",
      "author": "Spielberg",
      "year": "1969",
      "journal-title": "Operations Res."
    }
  ],
  "container-title": "Annals of Discrete Mathematics",
  "original-title": [],
  "deposited": {
    "date-parts": [
      [
        2018,
        12,
        29
      ]
    ],
    "date-time": "2018-12-29T01:27:05Z",
    "timestamp": 1546046825000
  },
  "score": 1,
  "resource": {
    "primary": {
      "URL": "https://linkinghub.elsevier.com/retrieve/pii/S0167506008707283"
    }
  },
  "subtitle": [],
  "short-title": [],
  "issued": {
    "date-parts": [
      [
        1977
      ]
    ]
  },
  "references-count": 18,
  "URL": "http://dx.doi.org/10.1016/S0167-5060(08)70728-3",
  "relation": {},
  "ISSN": [
    "0167-5060"
  ],
  "subject": [],
  "published": {
    "date-parts": [
      [
        1977
      ]
    ]
  }
}