Tow algorithms for finding a minimal ratio hamiltonian cycle in a network (Q4342960): 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.1080/02331939708844327 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2058034314 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametric approaches to fractional programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3677509 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Optimization with Rational Objective Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applying Parallel Computation Algorithms in the Design of Serial Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fractional programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Parametric Method for Solving the Linear Fractional Programming Problem / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 17:08, 27 May 2024

scientific article; zbMATH DE number 1026465
Language Label Description Also known as
English
Tow algorithms for finding a minimal ratio hamiltonian cycle in a network
scientific article; zbMATH DE number 1026465

    Statements

    Tow algorithms for finding a minimal ratio hamiltonian cycle in a network (English)
    0 references
    0 references
    5 February 1998
    0 references
    0 references
    parametric algorithms
    0 references
    Hamiltonian cycle in a network
    0 references
    time-to-profit ratio
    0 references
    0 references