Results 111 to 120 of about 145 (122)
Some of the next articles are maybe not open access.
Recent Advances in Polyhedral Combinatorics
2018Combinatorial optimization searches for an optimal object in a nite collection; typically the collection has a concise representation while the number of objects is huge. Polyhedral and linear programming techniques have proved to be very powerful and successful in tackling various combinatorial optimization problems, and the end products of these ...
openaire +3 more sources
Polyhedral Combinatorics of QAPs with Less Objects than Locations (Extended Abstract) [PDF]
, 1997 For the classical quadratic assignment problem (QAP), where n objects have to be assigned to n locations (the n×n-case), polyhedral studies have been started in the very recent years by several authors. In this paper, we investigate the variant of the QAP, where the number of locations may exceed the number of objects (the m×n-case).
openaire
Polyhedral combinatorics of the K-partitioning problem with representative variables
Discrete Applied Mathematics, 2016Alexandre Pauchet +2 more
exaly
A polyhedral approach to the single row facility layout problem
Mathematical Programming, 2012André R S Amaral +2 more
exaly
The time-dependent rural postman problem: polyhedral results
Optimization Methods and Software, 2013Guozhen Tan, Jinghao Sun
exaly
Lower Bounds in Lot-Sizing Models: A Polyhedral Study
Mathematics of Operations Research, 1998MIGUEL Constantino
exaly