Dennis J. Sweeney

According to our database, Dennis J. Sweeney authored at least 6 papers between 1979 and 2010.

Collaborative distances:

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

2010

Risk management strategies via minimax portfolio optimization.

George G. Polak, David F. Rogers, Dennis J. Sweeney

Eur. J. Oper. Res., 2010

1985

The reduced cost branch and bound algorithm for mixed integer programming.

R. Kipp Martin, Dennis J. Sweeney, Michael E. Doherty

Comput. Oper. Res., 1985

1983

An ideal column algorithm for integer programs with special ordered sets of variables.

R. Kipp Martin, Dennis J. Sweeney

Math. Program., 1983

1981

Branch and Bound Methods for Multi-Item Scheduling.

Dennis J. Sweeney, Richard A. Murphy

Oper. Res., 1981

1980

Using multidimensional scaling to solve traveling salesman and machine scheduling problems.

Gregory P. White, Dennis J. Sweeney

Comput. Oper. Res., 1980

1979

A Method of Decomposition for Integer Programs.

Dennis J. Sweeney, Richard A. Murphy

Oper. Res., 1979