# Michal Penn

According to our database

Collaborative distances:

^{1}, Michal Penn authored at least 35 papers between 1992 and 2021.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

2021

Complexity and algorithms for min cost and max profit scheduling under time-of-use electricity tariffs.

J. Sched., 2021

2019

J. Comput. Syst. Sci., 2019

2016

Proceedings of the Integration of AI and OR Techniques in Constraint Programming, 2016

2012

Network Optimization Models for Resource Allocation in Developing Military Countermeasures.

Oper. Res., 2012

2011

Discret. Appl. Math., 2011

Proceedings of the IJCAI 2011, 2011

2009

Math. Oper. Res., 2009

Games Econ. Behav., 2009

Eur. J. Oper. Res., 2009

Ann. Math. Artif. Intell., 2009

Proceedings of the Graph Theory, 2009

2008

Approximation algorithm for minimizing total latency in machine scheduling with deliveries.

Discret. Optim., 2008

A polynomial time algorithm for solving a quality control station configuration problem.

Discret. Appl. Math., 2008

Discret. Appl. Math., 2008

The Third Haifa Workshop on Interdisciplinary Applications of Graph Theory, Combinatorics, and Algorithms.

Discret. Appl. Math., 2008

Approximation algorithms for group prize-collecting and location-routing problems.

Discret. Appl. Math., 2008

2007

Networks, 2007

Creating a consensus ranking of proposals from reviewers' partial ordinal rankings.

Comput. Oper. Res., 2007

2005

Manag. Sci., 2005

2002

A Genetic Algorithm with a Compact Solution Encoding for the Container Ship Stowage Problem.

J. Heuristics, 2002

2000

J. Comb. Optim., 2000

Inf. Process. Lett., 2000

Container ship stowage problem: complexity and connection to the coloring of circle graphs.

Discret. Appl. Math., 2000

1998

Networks, 1998

Ann. Oper. Res., 1998

1997

Faster approximation algorithms for weighted triconnectivity augmentation problems.

Oper. Res. Lett., 1997

Improved Approximation Algorithms for Weighted 2- and 3-Vertex Connectivity Augmentation Problems.

J. Algorithms, 1997

1996

Networks, 1996

Polynomial Algorithms for (integral) Maximum Two-flows in Vertex Edge-capacitated Planar Graphs.

Discret. Appl. Math., 1996

1995

Discret. Math., 1995

Discret. Appl. Math., 1995

1993

Discret. Appl. Math., 1993

On the (integral) maximum tw flow in vertex and edge capacitated planar graphs.

Proceedings of the 3rd Integer Programming and Combinatorial Optimization Conference, Erice, Italy, April 29, 1993

1992

Oper. Res. Lett., 1992

Math. Program., 1992