Results 131 to 140 of about 417,011 (184)
A transformer-based structure-aware model for tackling the traveling salesman problem. [PDF]
Zhao CS, Wong LP.
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
The Continuous Knapsack Problem with Capacities
Journal of the Operations Research Society of China, 2020zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Huynh Duc Quoc +2 more
exaly +4 more sources
A faster algorithm for the continuous bilevel knapsack problem
Operations Research Letters, 2020We construct a fast algorithm with time complexity O ( n log n ) for a continuous bilevel knapsack problem with interdiction constraints for n items. This improves on a recent algorithm from the literature with quadratic time complexity O ( n 2 ) .
Dennis Fischer, Gerhard J Woeginger
exaly +3 more sources
A Newton’s method for the continuous quadratic knapsack problem
Mathematical Programming Computation, 2014zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Roberto Cominetti +2 more
exaly +4 more sources
Approximation algorithms on 0–1 linear knapsack problem with a single continuous variable
Journal of Combinatorial Optimization, 2013zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Xianyue Li
exaly +4 more sources
Continuous linear knapsack problems revisited
Journal of Information and Optimization Sciences, 2023In this paper, the continuous linear knapsack problem is considered. Some preliminary results are formulated and proved, and theorems concerning the optimal solution of the considered problem are stated and proved.
Stefan M. Stefanov
semanticscholar +2 more sources
A polynomial algorithm for a continuous bilevel knapsack problem
Operations Research Letters, 2018zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Margarida Carvalho +2 more
exaly +4 more sources

