Michal Penn

According to our database, Michal Penn authored at least 35 papers between 1992 and 2021.

Collaborative distances:

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

2021

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

Michal Penn, Tal Raviv

J. Sched., 2021

2019

Cyclic-routing of Unmanned Aerial Vehicles.

Nir Drucker, Hsi-Ming Ho, Joël Ouaknine, Michal Penn, Ofer Strichman

J. Comput. Syst. Sci., 2019

2016

Cyclic Routing of Unmanned Aerial Vehicles.

Nir Drucker, Michal Penn, Ofer Strichman

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

2012

Network Optimization Models for Resource Allocation in Developing Military Countermeasures.

Boaz Golany, Moshe Kress, Michal Penn, Uriel G. Rothblum

Oper. Res., 2012

2011

Congestion games with failures.

Michal Penn, Maria Polukarov, Moshe Tennenholtz

Discret. Appl. Math., 2011

Considerate Equilibrium.

Martin Hoefer, Michal Penn, Maria Polukarov, Alexander Skopalik, Berthold Vöcking

Proceedings of the IJCAI 2011, 2011

2009

Random Order Congestion Games.

Michal Penn, Maria Polukarov, Moshe Tennenholtz

Math. Oper. Res., 2009

Congestion games with load-dependent failures: Identical resources.

Michal Penn, Maria Polukarov, Moshe Tennenholtz

Games Econ. Behav., 2009

An algorithm for the maximum revenue jobshop problem.

Michal Penn, Tal Raviv

Eur. J. Oper. Res., 2009

Taxed congestion games with failures.

Michal Penn, Maria Polukarov, Moshe Tennenholtz

Ann. Math. Artif. Intell., 2009

Asynchronous Congestion Games.

Michal Penn, Maria Polukarov, Moshe Tennenholtz

Proceedings of the Graph Theory, 2009

2008

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

Asaf Levin, Michal Penn

Discret. Optim., 2008

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

Michal Penn, Tal Raviv

Discret. Appl. Math., 2008

Editorial.

Irith Ben-Arroyo Hartman, Seffi Naor, Michal Penn, Uriel G. Rothblum

Discret. Appl. Math., 2008

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

Irith Ben-Arroyo Hartman, Seffi Naor, Michal Penn, Uriel G. Rothblum

Discret. Appl. Math., 2008

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

Hagai Glicksman, Michal Penn

Discret. Appl. Math., 2008

2007

Approximation algorithm for the group Steiner network problem.

Michal Penn, Stas Rozenfeld

Networks, 2007

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

Wade D. Cook, Boaz Golany, Michal Penn, Tal Raviv

Comput. Oper. Res., 2007

2005

Optimal Allocation of Proposals to Reviewers to Facilitate Effective Ranking.

Wade D. Cook, Boaz Golany, Moshe Kress, Michal Penn, Tal Raviv

Manag. Sci., 2005

2002

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

Opher Dubrovsky, Gregory Levitin, Michal Penn

J. Heuristics, 2002

2000

On Integrality, Stability and Composition of Dicycle Packings and Covers.

Zeev Nutov, Michal Penn

J. Comb. Optim., 2000

Constrained multi-object auctions and b-matching.

Michal Penn, Moshe Tennenholtz

Inf. Process. Lett., 2000

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

Mordecai Avriel, Michal Penn, Naomi Shpirer

Discret. Appl. Math., 2000

1998

An extended planar algorithm for maximum integral two-flow.

Raanan Manor, Michal Penn

Networks, 1998

Stowage planning for container ships to reduce the number of shifts.

Mordecai Avriel, Michal Penn, Naomi Shpirer, Smadar Witteboon

Ann. Oper. Res., 1998

1997

Faster approximation algorithms for weighted triconnectivity augmentation problems.

Zeev Nutov, Michal Penn

Oper. Res. Lett., 1997

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

Michal Penn, Haya Shasha-Krupnik

J. Algorithms, 1997

1996

Disconnecting sets in single and two-terminal-pair networks.

Frieda Granot, Michal Penn, Maurice Queyranne

Networks, 1996

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

Frieda Granot, Michal Penn

Discret. Appl. Math., 1996

1995

On the integral 4-packing of T-cuts.

Frieda Granot, Michal Penn

Discret. Math., 1995

on the Integral Dicycle Packings and Covers and the Linear ordering Polytope.

Zeev Nutov, Michal Penn

Discret. Appl. Math., 1995

1993

A Fast Algorithm for Maximum Integral Two-Commodity Flow in Planar Graphs.

Ephraim Korach, Michal Penn

Discret. Appl. Math., 1993

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

Frieda Granot, Michal Penn

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

1992

On the integral plane two-commodity flow problem.

Frieda Granot, Michal Penn

Oper. Res. Lett., 1992

Tight integral duality gap in the Chinese Postman problem.

Ephraim Korach, Michal Penn

Math. Program., 1992