Evgeny Selensky

According to our database, Evgeny Selensky authored at least 7 papers between 2002 and 2006.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2006

A case study of mutual routing-scheduling reformulation.

J. Christopher Beck, Patrick Prosser, Evgeny Selensky

J. Sched., 2006

Constraint Models for the Covering Test Problem.

Brahim Hnich, Steven D. Prestwich, Evgeny Selensky, Barbara M. Smith

Constraints An Int. J., 2006

2004

Constraint-Based Approaches to the Covering Test Problem.

Brahim Hnich, Steven D. Prestwich, Evgeny Selensky

Proceedings of the Recent Advances in Constraints, 2004

2003

Vehicle Routing and Job Shop Scheduling: What's the Difference?

J. Christopher Beck, Patrick Prosser, Evgeny Selensky

Proceedings of the Thirteenth International Conference on Automated Planning and Scheduling (ICAPS 2003), 2003

2002

On the Reformulation of Vehicle Routing Problems and Scheduling Problems.

J. Christopher Beck, Patrick Prosser, Evgeny Selensky

Proceedings of the Abstraction, 2002

Graph Transformations for the Vehicle Routing and Job Shop Scheduling Problems.

J. Christopher Beck, Patrick Prosser, Evgeny Selensky

Proceedings of the Graph Transformation, First International Conference, 2002

A Study of Encodings of Constraint Satisfaction Problems with 0/1 Variables.

Patrick Prosser, Evgeny Selensky

Proceedings of the Recent Advances in Constraints, 2002