The balanced traveling salesman problem (Q614063): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 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/j.cor.2010.09.016 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2078701526 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum cost-reliability ratio path problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The balanced linear programming problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing a maximum cardinality matching in a bipartite graph in time \(O(n^{1,5}\sqrt{m/\log \,n})\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Maximum Scatter Traveling Salesperson Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Balanced problems on graphs with categorization of edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5389837 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Most and least uniform spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Balanced paths in acyclic networks: Tractable cases and related approaches / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new unifying heuristic algorithm for the undirected minimum cut problems using minimum range cut algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum deviation and balanced optimization: A unified approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum Range Balanced Cuts via Dynamic Subset Sums / rank
 
Normal rank
Property / cites work
 
Property / cites work: On finding most uniform spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing the Range of Lateness on a Single Machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: An \(\varepsilon\)-approximation scheme for combinatorial optimization problems with minimum variance criterion / rank
 
Normal rank
Property / cites work
 
Property / cites work: AN ε-APPROXIMATION SCHEME FOR MINIMUM VARIANCE PROBLEMS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for minimum range cut problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The asymmetric bottleneck traveling salesman problem: algorithms, complexity and empirical analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Minimizing the Range of Lateness on a Single Machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Effective Heuristic Algorithm for the Traveling-Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Balanced optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm to determine a path with minimal cost/capacity ratio / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Product Matrix Traveling Salesman Problem: An Application and Solution Heuristic / rank
 
Normal rank
Property / cites work
 
Property / cites work: On combined minmax-minsum optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lexicographic balanced optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constrained balanced optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some necessary conditions for a graph to be Hamiltonian / rank
 
Normal rank
Property / cites work
 
Property / cites work: A strongly polynomial algorithm for the uniform balanced network flow problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Depth-First Search and Linear Graph Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On generalized balanced optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Gilmore-Gomory's open question for the bottleneck TSP. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimization of maximum absolute deviation in integers / rank
 
Normal rank

Latest revision as of 14:56, 3 July 2024

scientific article
Language Label Description Also known as
English
The balanced traveling salesman problem
scientific article

    Statements

    The balanced traveling salesman problem (English)
    0 references
    0 references
    0 references
    23 December 2010
    0 references
    0 references
    0 references
    0 references
    0 references
    traveling salesman problem
    0 references
    balanced optimization
    0 references
    complexity
    0 references
    heuristics
    0 references
    experimental analysis
    0 references
    0 references
    0 references
    0 references
    0 references