On improving relaxation methods by modified gradient techniques-Reference-Cited by-同舟云学术

On improving relaxation methods by modified gradient techniques

Published:1975 Issue: Volume: Page:26-34
ISSN:0303-3929
Container-title:Nondifferentiable Optimization
language:
Short-container-title:

Author:

Camerini P. M.,Fratta L.,Maffioli F.

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/BFb0120697.pdf

Reference16 articles.

1. P.M. Camerini, L. Fratta and F. Maffioli, “A heuristically guided algorithm for the traveling salesman problem,” Journal of the Institution of Computer Science 4 (1973) 31–35.

2. P. M. Camerini and F. Maffioli, “Bounds for 3-matroid intersection problems,” Information Processing Letters 3 (1975) 81–83.

3. P.M. Camerini, L. Fratta and F. Maffioli, “Traveling salesman problem: heuristically guided search and modified gradient techniques,” to appear.

4. G.A. Croes, “A method for solving traveling salesman problems,” Operations Research 6 (1958) 791–812.

5. H. Crowder, “Computational improvements for subgradient optimization”, IBM Research Rept. RC 4907 (No. 21841) Thomas J. Watson Research Center (June 1974).

Cited by 162 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. One-Rank Linear Transformations and Fejer-Type Methods: An Overview;Mathematics;2024-05-14

2. Decomposition Methods for Choice-Based Optimization Models;International Series in Operations Research & Management Science;2024

3. A Lagrangian relaxation approach to an electricity system investment model with a high temporal resolution;OR Spectrum;2023-11-09

4. Joint Optimization of Multi-Cycle Timetable Considering Supply-to-Demand Relationship and Energy Consumption for Rail Express;Mathematics;2022-11-07

5. An Adjustable Robust Two-stage Stochastic Quadric Programming and its Solution with Subgradient Algorithms;Proceedings of the 6th International Conference on Algorithms, Computing and Systems;2022-09-16