The following pages link to Daniel Karapetyan (Q439652):
Displaying 15 items.
- Efficient local search algorithms for known and new neighborhoods for the generalized traveling salesman problem (Q439653) (← links)
- Average value of solutions for the bipartite Boolean quadratic programs and rounding algorithms (Q482289) (← links)
- Local search heuristics for the multidimensional assignment problem (Q544814) (← links)
- Lin-Kernighan heuristic adaptations for the generalized traveling salesman problem (Q621685) (← links)
- A memetic algorithm for the generalized traveling salesman problem (Q968380) (← links)
- Markov chain methods for the bipartite Boolean quadratic programming problem (Q1753461) (← links)
- Conditional Markov Chain search for the simple plant location problem improves upper bounds on twelve Körkel-Ghosh instances (Q2315579) (← links)
- The quadratic balanced optimization problem (Q2339810) (← links)
- The bipartite unconstrained 0-1 quadratic programming problem: polynomially solvable cases (Q2355744) (← links)
- Lessons from building an automated pre-departure sequencer for airports (Q2398434) (← links)
- Domination Analysis of Algorithms for Bipartite Boolean Quadratic Programs (Q2842791) (← links)
- An Efficient Hybrid Ant Colony System for the Generalized Traveling Salesman Problem (Q2865878) (← links)
- (Q2867371) (← links)
- (Q3084797) (← links)
- Pattern-Based Approach to the Workflow Satisfiability Problem with User-Independent Constraints (Q5232784) (← links)
