FEASIBLE REGION REDUCTION CUTS FOR THE SIMPLE PLANT LOCATION PROBLEM

DOI10.15807/JORSJ.39.614zbMATH Open0874.90115OpenAlexW2100049379MaRDI QIDQ4347340FDOQ4347340

Authors: Y. S. Myung, Dong-wan Tcha 

Publication date: 7 August 1997

Published in: Journal of the Operations Research Society of Japan (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.15807/jorsj.39.614

Recommendations

• New valid inequalities and facets for the simple plant location problem
• scientific article; zbMATH DE number 4095174
• On the Uncapacitated Plant Location Problem. I: Valid Inequalities and Facets
• A Lagrangean dual ascent algorithm for simple plant location problems
• Valid inequalities and facets of the capacitated plant location problem

zbMATH Keywords

valid inequalitiessimple plant location problemstrong cuts

Mathematics Subject Classification ID

Discrete location and assignment (90B80)

Cited In (2)

• A NEW FORMULATION AND RELAXATION OF THE SIMPLE PLANT LOCATION PROBLEM
• An aggressive reduction scheme for the simple plant location problem

This page was built for publication: FEASIBLE REGION REDUCTION CUTS FOR THE SIMPLE PLANT LOCATION PROBLEM

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4347340)