Categorized bottleneck-minisum path problems on networks (Q1890954): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
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(94)90043-4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1989754835 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The assignment problem under categorized jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bottleneck assignment problems under categorization / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Constrained Bottleneck Problem in Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Traveling salesman problem under categorization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum perfect bipartite matchings and spanning trees under categorization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Generalisations of the Time Minimising Assignment Problem / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 13:38, 23 May 2024

scientific article
Language Label Description Also known as
English
Categorized bottleneck-minisum path problems on networks
scientific article

    Statements

    Identifiers