scientific article; zbMATH DE number 1973378
From MaRDI portal
Publication:4421940
zbMATH Open1106.90002MaRDI QIDQ4421940FDOQ4421940
Authors:
Publication date: 1 September 2003
Title of this publication is not available (Why is that?)
Parallel numerical computation (65Y05) Approximation methods and heuristics in mathematical programming (90C59) Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27) Collections of articles of miscellaneous specific interest (00B15) Proceedings, conferences, collections, etc. pertaining to operations research and mathematical programming (90-06)
Cited In (36)
- The secret life of keys: on the calculation of mechanical lock systems
- Granular tabu search for the pickup and delivery problem with time windows and electric vehicles
- Efficient local search strategies for the mixed capacitated arc routing problems under time restrictions with intermediate facilities
- Random colorings in manifolds
- Dominance inequalities for scheduling around an unrestrictive common due date
- Compromise designs under baseline parameterization
- Inexact multi-objective local search proximal algorithms: application to group dynamic and distributive justice problems
- Feasibility jump: an LP-free Lagrangian MIP heuristic
- Stable assignment with couples: parameterized complexity and local search
- A model and two heuristic approaches for a forage Harvester planning problem: a case study
- Local search proximal algorithms as decision dynamics with costs to move
- Heuristics for multi-attribute vehicle routing problems: a survey and synthesis
- Block coordinate descent for smooth nonconvex constrained minimization
- Approximate Local Search in Combinatorial Optimization
- Revising history for cost-informed process improvement
- Prospect theory-based portfolio optimization: an empirical study and analysis using intelligent algorithms
- Analyzing different variants of immune inspired somatic contiguous hypermutations
- Heuristic algorithms for the cardinality constrained efficient frontier
- 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
- Political districting: from classical models to recent approaches
- Learning reward machines: a study in partially observable reinforcement learning
- 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
- Computational aspects of the colorful Carathéodory theorem
- Planning for agricultural forage harvesters and trucks: model, heuristics, and case study
- On theoretical and empirical algorithmic analysis of the efficiency gap measure in partisan gerrymandering
- Stability and recovery for independence systems
- Black-box combinatorial optimization using models with integer-valued minima
- Batch picking in narrow-aisle order picking systems with consideration for picker blocking
- Seeking global edges for traveling salesman problem in multi-start search
- New model and heuristics for safety stock placement in general acyclic supply chain networks
- An improved tabu search algorithm for the petrol-station replenishment problem with adjustable demands
- Matheuristics for optimizing the network in German wagonload traffic
- Algorithmic search for baseline minimum aberration designs
- A locally-biased form of the DIRECT algorithm.
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4421940)
