On the role of bottleneck Monge matrices in combinatorial optimization (Q1904608): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Rainer E. Burkard / rank
Normal rank
 
Property / author
 
Property / author: Rainer E. Burkard / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0167-6377(95)00003-3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2036665495 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3964287 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4191842 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficiently solvable special cases of bottleneck travelling salesman problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3942759 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5557602 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal two- and three-stage production schedules with setup times included / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the recognition of permuted bottleneck Monge matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: A concise survey of efficiently solvable special cases of the permutation flow-shop problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal algorithm for \(2 \times{} n\) bottleneck transportation problems / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 09:00, 24 May 2024

scientific article
Language Label Description Also known as
English
On the role of bottleneck Monge matrices in combinatorial optimization
scientific article

    Statements

    On the role of bottleneck Monge matrices in combinatorial optimization (English)
    0 references
    2 May 1996
    0 references
    0 references
    0 references
    0 references
    0 references
    bottleneck Monge property
    0 references
    flow shop
    0 references
    minimum makespan
    0 references
    time transportation
    0 references
    bottleneck travelling salesman
    0 references
    0 references
    0 references