Publication:4421940
From MaRDI portal
zbMath1106.90002MaRDI QIDQ4421940
No author found.
Publication date: 1 September 2003
68Q25: Analysis of algorithms and problem complexity
90C59: Approximation methods and heuristics in mathematical programming
90C27: Combinatorial optimization
00B15: Collections of articles of miscellaneous specific interest
65Y05: Parallel numerical computation
90-06: Proceedings, conferences, collections, etc. pertaining to operations research and mathematical programming
Related Items
Prospect theory–based portfolio optimization: an empirical study and analysis using intelligent algorithms, Modeling and solution of maximal covering problem considering gradual coverage with variable radius over multi-periods, Stability and Recovery for Independence Systems, The Secret Life of Keys: On the Calculation of Mechanical Lock Systems, Revising history for cost-informed process improvement, Stable assignment with couples: parameterized complexity and local search, Local search algorithms for multiple-depot vehicle routing and for multiple traveling salesman problems with proved performance guarantees, A model and two heuristic approaches for a forage Harvester planning problem: a case study, Analyzing different variants of immune inspired somatic contiguous hypermutations, Local search proximal algorithms as decision dynamics with costs to move, Seeking global edges for traveling salesman problem in multi-start search, Political districting: From classical models to recent approaches, On theoretical and empirical algorithmic analysis of the efficiency gap measure in partisan gerrymandering, Planning for agricultural forage harvesters and trucks: model, heuristics, and case study, Inexact multi-objective local search proximal algorithms: application to group dynamic and distributive justice problems, Matheuristics for optimizing the network in German wagonload traffic, Efficient local search strategies for the mixed capacitated arc routing problems under time restrictions with intermediate facilities, New model and heuristics for safety stock placement in general acyclic supply chain networks, Batch picking in narrow-aisle order picking systems with consideration for picker blocking, Computational aspects of the colorful Carathéodory theorem, Granular tabu search for the pickup and delivery problem with time windows and electric vehicles, Black-box combinatorial optimization using models with integer-valued minima, Block coordinate descent for smooth nonconvex constrained minimization, Effectiveness of carbon pricing policies for promoting urban freight electrification: analysis of last mile delivery in Madrid, Dominance inequalities for scheduling around an unrestrictive common due date, Heuristic algorithms for the cardinality constrained efficient frontier, Heuristics for multi-attribute vehicle routing problems: a survey and synthesis, Political districting: from classical models to recent approaches, Compromise designs under baseline parameterization, Algorithmic search for baseline minimum aberration designs
