Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
Extending single tolerances to set tolerances - MaRDI portal

Deprecated: Use of MediaWiki\Skin\SkinTemplate::injectLegacyMenusIntoPersonalTools was deprecated in Please make sure Skin option menus contains `user-menu` (and possibly `notifications`, `user-interface-preferences`, `user-page`) 1.46. [Called from MediaWiki\Skin\SkinTemplate::getPortletsTemplateData in /var/www/html/w/includes/Skin/SkinTemplate.php at line 691] in /var/www/html/w/includes/Debug/MWDebug.php on line 372

Deprecated: Use of QuickTemplate::(get/html/text/haveData) with parameter `personal_urls` was deprecated in MediaWiki Use content_navigation instead. [Called from MediaWiki\Skin\QuickTemplate::get in /var/www/html/w/includes/Skin/QuickTemplate.php at line 131] in /var/www/html/w/includes/Debug/MWDebug.php on line 372

Extending single tolerances to set tolerances (Q1671336)

From MaRDI portal

Jump to:navigation, search

This is the item page for this Wikibase entity, intended for internal use and editing purposes.

Please use this page instead for the normal view: Extending single tolerances to set tolerances

scientific article; zbMATH DE number 6933514

Language	Label	Description	Also known as
English	Extending single tolerances to set tolerances	scientific article; zbMATH DE number 6933514

Statements

scholarly article

0 references

Extending single tolerances to set tolerances (English)

0 references

0 references

Marcel Turkensteen

0 references

Discrete Applied Mathematics

0 references

publication date

6 September 2018

0 references

full work available at URL

https://pure.au.dk/ws/files/166885572/Turkensteen_2018_Extending_single_tolerances_to_set_tolerances.pdf

0 references

zbMATH Keywords

sensitivity analysis

0 references

combinatorial optimization

0 references

single tolerance

0 references

set tolerance

0 references

describes a project that uses

0 references

MaRDI profile type

0 references

An Algorithm for the Three-Index Assignment Problem

0 references

Experimental and Efficient Algorithms

0 references

Assignment Problems

0 references

Efficiently solvable special cases of bottleneck travelling salesman problems

0 references

Algorithms for updating minimal spanning trees

0 references

Advances in sensitivity analysis and parametric programming

0 references

Lower tolerance-based branch and bound algorithms for the ATSP

0 references

Tolerance-based Algorithms for the Traveling Salesman Problem

0 references

Some Basics on Tolerances

0 references

Tolerance Based Contract-or-Patch Heuristic for the Asymmetric TSP

0 references

Graph-Theoretic Concepts in Computer Science

0 references

0 references

A note on Arc tolerances in sparse shortest-path and network flow problems

0 references

Worst case analysis of max-regret, greedy and other heuristics for multidimensional assignment and traveling salesman problems

0 references

Sensitivity analysis for scheduling problems

0 references

An effective implementation of the Lin-Kernighan traveling salesman heuristic

0 references

Algorithms and Experimental Study for the Traveling Salesman Problem of Second Order

0 references

Sensitivity analysis for minimum Hamiltonian path and traveling salesman problems

0 references

A note on robustness tolerances for combinatorial optimization problems

0 references

Letter to the Editor—An Algorithm for Ranking all the Assignments in Order of Increasing Cost

0 references

Sensitivity analysis for shortest path problems and maximum capacity path problems in undirected graphs

0 references

Improving the Efficiency of Helsgaun’s Lin-Kernighan Heuristic for the Symmetric TSP

0 references

Arc tolerances in shortest path and network flow problems

0 references

The stability of the approximate Boolean minimization of a linear form

0 references

Some concepts of stability analysis in combinatorial optimization

0 references

Tolerance-based branch and bound algorithms for the ATSP

0 references

Solving the \(k\)-best traveling salesman problem

0 references

An \(O(n)\) algorithm to solve the Bottleneck Traveling Salesman Problem restricted to ordered product matrices

0 references

An addendum on: ``Sensitivity analysis of the optimal assignment''

0 references

Recommended article

The reduction of computation times of upper and lower tolerances for selected combinatorial optimization problems

Similarity Score

0.807301938533783

Recommender Run

Recommender Run 4

0 references

Extremal values of global tolerances in combinatorial optimization with an additive objective function

Similarity Score

0.7928488254547119

Recommender Run

Recommender Run 4

0 references

Global tolerances in the problems of combinatorial optimization with an additive objective function

Similarity Score

0.782547116279602

Recommender Run

Recommender Run 4

0 references

A combinatorial arc tolerance analysis for network flow problems

Similarity Score

0.7499614357948303

Recommender Run

Recommender Run 4

0 references

Identifiers

zbMATH Open document ID

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

0 references

10.1016/J.DAM.2018.03.053

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1671336

Retrieved from "https://mardi.schubotz.org/w/index.php?title=Item:Q1671336&oldid=44587422"