Heuristics and reduction methods for multiple constraints 0–1 linear programming problems-Reference-Cited by-同舟云学术

Heuristics and reduction methods for multiple constraints 0–1 linear programming problems

Published:1986-02 Issue:2 Volume:24 Page:206-215
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Freville A.,Plateau G.

Publisher

Elsevier BV

Subject

Information Systems and Management,Management Science and Operations Research,Modelling and Simulation,General Computer Science,Industrial and Manufacturing Engineering

Reference25 articles.

1. Pivot and complement—a heuristic for 0–1 programming;Balas;Management Science Research,1980

2. On improving relaxation methods by modified gradient techniques;Camerini;Mathematical Programming Study,1975

3. Calculating surrogate constraints;Dyer;Mathematical Programming,1980

4. An algorithm for the solution of the 0–1 knapsack problem;Fayard;Computing,1982

5. Contribution à la résolution des programmes mathématiques en nombres entiers;Fayard;dissertation,1979

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

1. Matheuristics: survey and synthesis;International Transactions in Operational Research;2023-04-15

2. Application of the CGVRP model and the 0-1 linear programming determines the RASKIN (subsidized rice) distribution route;Journal of Physics: Conference Series;2021-02-01

3. A Variable Neighborhood Search with Integer Programming for the Zero-One Multiple-Choice Knapsack Problem with Setup;Variable Neighborhood Search;2019

4. Revenue Maximization for Dynamic Expansion of Geo-distributed Cloud Data Centers;IEEE Transactions on Cloud Computing;2018

5. 0-1 Knapsack Problems;Paradigms of Combinatorial Optimization;2014-08-08