Search results

From MaRDI portal
View (previous 20 | ) (20 | 50 | 100 | 250 | 500)
  • Gap of the Subtour LP for the Circulant Traveling Salesman Problem 2019-12-18 Paper The Unbounded Integrality Gap of a Semidefinite Relaxation of the Traveling...
    10 bytes (18 words) - 01:42, 25 September 2023
  • 2020-09-01 Paper https://portal.mardi4nfdi.de/entity/Q5111751 2020-05-27 Paper Subtour elimination constraints imply a matrix-tree theorem SDP constraint for the...
    10 bytes (19 words) - 10:10, 11 December 2023
  • pollution-routing problem 2015-02-18 Paper Requiem for the Miller-Tucker-Zemlin subtour elimination constraints? 2015-02-03 Paper An adaptive large neighborhood...
    10 bytes (17 words) - 14:50, 10 December 2023
  • generation in the integral simplex method 2008-10-17 Paper Lagrangian Relaxation via Ballstep Subgradient Methods 2008-05-27 Paper Convergent Lagrangian...
    10 bytes (17 words) - 16:47, 24 September 2023
  • compact formulations 2015-03-12 Paper Requiem for the Miller-Tucker-Zemlin subtour elimination constraints? 2015-02-03 Paper An improved decomposition-based...
    10 bytes (16 words) - 23:53, 8 December 2023
  • three-player attack-defense with unknown gradient 2022-01-25 Paper Adaptive Relaxation Strategy on Basic Iterative Methods for Solving Linear Systems with Single...
    10 bytes (17 words) - 22:59, 10 December 2023
  • Minimum-weight two-connected spanning networks 1990-01-01 Paper Optimizing over the subtour polytope of the travelling salesman problem 1990-01-01 Paper The perfectly...
    10 bytes (19 words) - 09:16, 12 December 2023
  • network design 2020-05-27 Paper A note on the lifted Miller-Tucker-Zemlin subtour elimination constraints for routing problems with time windows 2020-04-07...
    10 bytes (16 words) - 19:46, 9 December 2023
  • matching games in polynomial time 2020-02-06 Paper Vehicle routing with subtours 2019-11-28 Paper Additive stabilizers for unstable graphs 2019-06-13 Paper...
    10 bytes (16 words) - 11:39, 11 December 2023
  • Paper https://portal.mardi4nfdi.de/entity/Q4217583 1999-06-08 Paper A new subtour elimination constraint for the vehicle routing problem 1999-02-22 Paper...
    10 bytes (17 words) - 17:04, 8 December 2023
  • 1016/0167-6377(89)90004-7 zbMATH Keywords complexity; traveling salesman; subtour relaxation Mathematics Subject Classification ID 90C35: Programming involving...
    15 bytes (70 words) - 03:36, 31 January 2024
  • Keywords traveling salesman problem; integrality gap; gluing subtours; subtour elimination relaxation Mathematics Subject Classification ID 68Wxx: Algorithms...
    15 bytes (37 words) - 13:08, 8 February 2024
  • Keywords half-integral solution; matroid intersection polytope; subtour-elimination relaxation Mathematics Subject Classification ID 90C27: Combinatorial optimization...
    15 bytes (57 words) - 01:31, 2 February 2024
  • Propagation of harmonic perturbations in a thermoelastic medium with heat relaxation 2014-11-11 Paper Solitary-wave solutions of the Klein-Gordon equation...
    10 bytes (15 words) - 12:42, 7 October 2023
  • on plane waves in generalized thermo-microstretch elastic solid with a relaxation time 2014-08-21 Paper An adaptive remeshing strategy for viscoelastic...
    10 bytes (16 words) - 12:14, 7 October 2023
  • for Journal in Brave) zbMATH Keywords Lagrangean relaxation; liftings; subgradient optimization; subtour elimination; Hop constrained minimal spanning tree...
    15 bytes (50 words) - 15:52, 1 February 2024
  • https://arxiv.org/abs/1907.11669 zbMATH Keywords SDP relaxation; traveling salesman problem; matrix-tree theorem; subtour LP Mathematics Subject Classification ID...
    15 bytes (65 words) - 02:25, 2 February 2024
  • Keywords traveling salesman problem; extreme solutions; subtour elimination linear program relaxation Mathematics Subject Classification ID 90C27: Combinatorial...
    15 bytes (64 words) - 04:07, 30 January 2024
  • Keywords local search; heuristic; linear programming relaxation; polynomial time; traps; subtour elimination constraints; symmetric travelling salesman...
    15 bytes (83 words) - 03:10, 31 January 2024
  • Brave) zbMATH Keywords branch-and-bound algorithm; vehicle routing; relaxation; subtour elimination constraints; split delivery; connectivity constraints;...
    15 bytes (84 words) - 13:29, 31 January 2024
View (previous 20 | ) (20 | 50 | 100 | 250 | 500)