Nicolai N. Pisaruk

According to our database, Nicolai N. Pisaruk authored at least 8 papers between 1999 and 2014.

Collaborative distances:

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

2014

Fence facets from non-regular graphs for the linear ordering polytope.

G. G. Bolotashvili, Vitali M. Demidenko, Nicolai N. Pisaruk

Optim. Lett., 2014

2006

A 2-approximation algorithm for the network substitution problem.

Nicolai N. Pisaruk

Oper. Res. Lett., 2006

Detecting infeasibility and generating cuts for mixed integer programming using constraint programming.

Alexander Bockmayr, Nicolai Pisaruk

Comput. Oper. Res., 2006

2004

On unions and dominants of polytopes.

Egon Balas, Alexander Bockmayr, Nicolai Pisaruk, Laurence A. Wolsey

Math. Program., 2004

2003

A fully combinatorial 2-approximation algorithm for precedence-constrained scheduling a single machine to minimize average weighted completion time.

Nicolai N. Pisaruk

Discret. Appl. Math., 2003

2001

Solving Assembly Line Balancing Problems by Combining IP and CP

Alexander Bockmayr, Nicolai Pisaruk

CoRR, 2001

Network Flow Problems in Constraint Programming.

Alexander Bockmayr, Nicolai Pisaruk, Abderrahmane Aggoun

Proceedings of the Principles and Practice of Constraint Programming, 2001

1999

Mean Cost Cyclical Games.

Nicolai N. Pisaruk

Math. Oper. Res., 1999