The following pages link to (Q4421940):
Displayed 30 items.
- Revising history for cost-informed process improvement (Q335888) (← links)
- Stable assignment with couples: parameterized complexity and local search (Q456691) (← links)
- Local search algorithms for multiple-depot vehicle routing and for multiple traveling salesman problems with proved performance guarantees (Q489718) (← links)
- A model and two heuristic approaches for a forage Harvester planning problem: a case study (Q611002) (← links)
- Analyzing different variants of immune inspired somatic contiguous hypermutations (Q627102) (← links)
- Local search proximal algorithms as decision dynamics with costs to move (Q632228) (← links)
- Seeking global edges for traveling salesman problem in multi-start search (Q652693) (← links)
- Political districting: From classical models to recent approaches (Q657583) (← links)
- On theoretical and empirical algorithmic analysis of the efficiency gap measure in partisan gerrymandering (Q782765) (← links)
- Planning for agricultural forage harvesters and trucks: model, heuristics, and case study (Q993459) (← links)
- Inexact multi-objective local search proximal algorithms: application to group dynamic and distributive justice problems (Q1637356) (← links)
- Matheuristics for optimizing the network in German wagonload traffic (Q1707082) (← links)
- Efficient local search strategies for the mixed capacitated arc routing problems under time restrictions with intermediate facilities (Q1722978) (← links)
- New model and heuristics for safety stock placement in general acyclic supply chain networks (Q1762120) (← links)
- Batch picking in narrow-aisle order picking systems with consideration for picker blocking (Q1926889) (← links)
- Computational aspects of the colorful Carathéodory theorem (Q1991350) (← links)
- Granular tabu search for the pickup and delivery problem with time windows and electric vehicles (Q1999625) (← links)
- Black-box combinatorial optimization using models with integer-valued minima (Q2043440) (← links)
- Block coordinate descent for smooth nonconvex constrained minimization (Q2162523) (← links)
- Effectiveness of carbon pricing policies for promoting urban freight electrification: analysis of last mile delivery in Madrid (Q2228276) (← links)
- Dominance inequalities for scheduling around an unrestrictive common due date (Q2242293) (← links)
- Heuristic algorithms for the cardinality constrained efficient frontier (Q2275807) (← links)
- Heuristics for multi-attribute vehicle routing problems: a survey and synthesis (Q2356202) (← links)
- Political districting: from classical models to recent approaches (Q2393445) (← links)
- Compromise designs under baseline parameterization (Q2409633) (← links)
- Algorithmic search for baseline minimum aberration designs (Q2448811) (← links)
- Prospect theory–based portfolio optimization: an empirical study and analysis using intelligent algorithms (Q4555083) (← links)
- Modeling and solution of maximal covering problem considering gradual coverage with variable radius over multi-periods (Q4634322) (← links)
- Stability and Recovery for Independence Systems (Q5111712) (← links)
- The Secret Life of Keys: On the Calculation of Mechanical Lock Systems (Q5738136) (← links)