scientific article; zbMATH DE number 1973378
From MaRDI portal
Publication:4421940
Collections of articles of miscellaneous specific interest (00B15) Parallel numerical computation (65Y05) Analysis of algorithms and problem complexity (68Q25) Proceedings, conferences, collections, etc. pertaining to operations research and mathematical programming (90-06) Combinatorial optimization (90C27) Approximation methods and heuristics in mathematical programming (90C59)
Cited in
(46)- 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
- Revising history for cost-informed process improvement
- Prospect theory-based portfolio optimization: an empirical study and analysis using intelligent algorithms
- Stable assignment with couples: parameterized complexity and local search
- Modeling and solution of maximal covering problem considering gradual coverage with variable radius over multi-periods
- Approximate Local Search in Combinatorial Optimization
- Local search algorithms for multiple-depot vehicle routing and for multiple traveling salesman problems with proved performance guarantees
- Stability and recovery for independence systems
- The secret life of keys: on the calculation of mechanical lock systems
- An improved tabu search algorithm for the petrol-station replenishment problem with adjustable demands
- A locally-biased form of the DIRECT algorithm.
- Random colorings in manifolds
- Learning reward machines: a study in partially observable reinforcement learning
- A model and two heuristic approaches for a forage Harvester planning problem: a case study
- Feasibility jump: an LP-free Lagrangian MIP heuristic
- 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
- A matheuristic for the split delivery capacitated profitable tour problem with incomplete service
- A k-swap local search for makespan scheduling
- Minimum aberration factorial designs under a mixed parametrization
- Improved smoothed analysis of 2-opt for the Euclidean TSP
- Performance of efficient variants of the 2-opt heuristic for the traveling salesperson problem
- Improved smoothed analysis of 2-opt for the Euclidean TSP
- Smoothed analysis of the k-swap neighborhood for makespan scheduling
- One-sided markets with externalities
- Complexity of local search for Euclidean clustering problems
- Counting locally optimal tours in the TSP
- 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
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)
