Tabu search applied to the general fixed charge problem (Q2367015): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q57570802, #quickstatements; #temporary_batch_1711574657256
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Improved Penalties for Fixed Cost Linear Programs Using Lagrangean Relaxation / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Separable Nonconvex Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Future paths for integer programming and links to artificial intelligence / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-bound algorithm for solving fixed charge problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A computational study of using preprocessing and stronger formulations to solve large general fixed charge problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tabu search techniques. A tutorial and an application to neural networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Heuristic Adjacent Extreme Point Algorithm for the Fixed Charge Problem / rank
 
Normal rank

Latest revision as of 18:20, 17 May 2024