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