scientific article
From MaRDI portal
Publication:2867366
zbMath1277.90138MaRDI QIDQ2867366
Bruno Escoffier, Martin Milanič, Vangelis Th. Paschos
Publication date: 11 December 2013
Full work available at URL: http://journals.hil.unb.ca/index.php/AOR/article/view/5653
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Reoptimization of Steiner trees: changing the terminal set ⋮ A survey on combinatorial optimization in dynamic environments ⋮ Reoptimization of constraint satisfaction problems with approximation resistant predicates ⋮ Reoptimization of maximum weight induced hereditary subgraph problems ⋮ Robust reoptimization of Steiner trees ⋮ Steiner tree reoptimization in graphs with sharpened triangle inequality ⋮ Unnamed Item ⋮ Reoptimization of Steiner Trees ⋮ Reoptimization of the shortest common superstring problem ⋮ Analysis and Experimental Study of Heuristics for Job Scheduling Reoptimization Problems ⋮ A theory and algorithms for combinatorial reoptimization ⋮ On the existence of polynomial-time approximation schemes for the reoptimization of discrete optimization problems ⋮ Reoptimization of max \(k\)-cover: approximation ratio threshold ⋮ On the approximation ratio threshold for the reoptimization of the maximum number of satisfied equations in linear systems over a finite field ⋮ Reoptimization in machine scheduling ⋮ A note on the traveling salesman reoptimization problem under vertex insertion ⋮ Knowing All Optimal Solutions Does Not Help for TSP Reoptimization ⋮ Reoptimization of set covering problems ⋮ Reoptimization of the metric deadline TSP ⋮ Reoptimization of the Metric Deadline TSP ⋮ Fast reoptimization for the minimum spanning tree problem ⋮ New Reoptimization Techniques applied to Steiner Tree Problem ⋮ Reoptimization of minimum and maximum traveling salesman's tours
