Michal Penn

40 papers A* 3B 2Journal 32Unranked 3
YearRankTypeTitle / Venue / Authors
2021 J jnl
Complexity and algorithms for min cost and max profit scheduling under time-of-use electricity tariffs.
J. Sched.
Michal Penn, Tal Raviv
2019 J jnl
Cyclic-routing of Unmanned Aerial Vehicles.
J. Comput. Syst. Sci.
Nir Drucker, Hsi-Ming Ho, Joël Ouaknine, Michal Penn, Ofer Strichman
2016 B conf
Cyclic Routing of Unmanned Aerial Vehicles.
CPAIOR
Nir Drucker, Michal Penn, Ofer Strichman
2012 J jnl
Network Optimization Models for Resource Allocation in Developing Military Countermeasures.
Oper. Res.
Boaz Golany, Moshe Kress, Michal Penn, Uriel G. Rothblum
2011 J jnl
Congestion games with failures.
Discret. Appl. Math.
Michal Penn, Maria Polukarov, Moshe Tennenholtz
2011 A* conf
Considerate Equilibrium.
IJCAI
Martin Hoefer, Michal Penn, Maria Polukarov, Alexander Skopalik, Berthold Vöcking
2010 J jnl
Considerate Equilibrium
CoRR
Martin Hoefer, Michal Penn, Maria Polukarov, Alexander Skopalik, Berthold Vöcking
2009 J jnl
An algorithm for the maximum revenue jobshop problem.
Eur. J. Oper. Res.
Michal Penn, Tal Raviv
2009 — conf
Asynchronous Congestion Games.
Graph Theory, Computational Intelligence and Thought
Michal Penn, Maria Polukarov, Moshe Tennenholtz
2009 J jnl
Congestion games with load-dependent failures: Identical resources.
Games Econ. Behav.
Michal Penn, Maria Polukarov, Moshe Tennenholtz
2009 J jnl
Random Order Congestion Games.
Math. Oper. Res.
Michal Penn, Maria Polukarov, Moshe Tennenholtz
2009 J jnl
Taxed congestion games with failures.
Ann. Math. Artif. Intell.
Michal Penn, Maria Polukarov, Moshe Tennenholtz
2008 J jnl
A polynomial time algorithm for solving a quality control station configuration problem.
Discret. Appl. Math.
Michal Penn, Tal Raviv
2008 J jnl
Approximation algorithm for minimizing total latency in machine scheduling with deliveries.
Discret. Optim.
Asaf Levin, Michal Penn
2008 J jnl
Approximation algorithms for group prize-collecting and location-routing problems.
Discret. Appl. Math.
Hagai Glicksman, Michal Penn
2008 — conf
Asynchronous congestion games.
AAMAS (3)
Michal Penn, Maria Polukarov, Moshe Tennenholtz
2008 J jnl
Editorial.
Discret. Appl. Math.
Irith Ben-Arroyo Hartman, Seffi Naor, Michal Penn, Uriel G. Rothblum
2008 J jnl
The Third Haifa Workshop on Interdisciplinary Applications of Graph Theory, Combinatorics, and Algorithms.
Discret. Appl. Math.
Irith Ben-Arroyo Hartman, Seffi Naor, Michal Penn, Uriel G. Rothblum
2007 J jnl
Approximation algorithm for the group Steiner network problem.
Networks
Michal Penn, Stas Rozenfeld
2007 A* conf
Congestion games with load-dependent failures: identical resources.
EC
Michal Penn, Maria Polukarov, Moshe Tennenholtz
2007 J jnl
Creating a consensus ranking of proposals from reviewers' partial ordinal rankings.
Comput. Oper. Res.
Wade D. Cook, Boaz Golany, Michal Penn, Tal Raviv
2005 — conf
Congestion games with failures.
Computing and Markets
Michal Penn, Maria Polukarov, Moshe Tennenholtz
2005 A* conf
Congestion games with failures.
EC
Michal Penn, Maria Polukarov, Moshe Tennenholtz
2005 J jnl
Optimal Allocation of Proposals to Reviewers to Facilitate Effective Ranking.
Manag. Sci.
Wade D. Cook, Boaz Golany, Moshe Kress, Michal Penn, Tal Raviv
2002 J jnl
A Genetic Algorithm with a Compact Solution Encoding for the Container Ship Stowage Problem.
J. Heuristics
Opher Dubrovsky, Gregory Levitin, Michal Penn
2000 J jnl
Constrained multi-object auctions and b-matching.
Inf. Process. Lett.
Michal Penn, Moshe Tennenholtz
2000 J jnl
Container ship stowage problem: complexity and connection to the coloring of circle graphs.
Discret. Appl. Math.
Mordecai Avriel, Michal Penn, Naomi Shpirer
2000 J jnl
On Integrality, Stability and Composition of Dicycle Packings and Covers.
J. Comb. Optim.
Zeev Nutov, Michal Penn
1998 J jnl
An extended planar algorithm for maximum integral two-flow.
Networks
Raanan Manor, Michal Penn
1998 J jnl
Stowage planning for container ships to reduce the number of shifts.
Ann. Oper. Res.
Mordecai Avriel, Michal Penn, Naomi Shpirer, Smadar Witteboon
1997 J jnl
Faster approximation algorithms for weighted triconnectivity augmentation problems.
Oper. Res. Lett.
Zeev Nutov, Michal Penn
1997 J jnl
Improved Approximation Algorithms for Weighted 2- and 3-Vertex Connectivity Augmentation Problems.
J. Algorithms
Michal Penn, Haya Shasha-Krupnik
1996 J jnl
Disconnecting sets in single and two-terminal-pair networks.
Networks
Frieda Granot, Michal Penn, Maurice Queyranne
1996 J jnl
Polynomial Algorithms for (integral) Maximum Two-flows in Vertex Edge-capacitated Planar Graphs.
Discret. Appl. Math.
Frieda Granot, Michal Penn
1995 J jnl
On the integral 4-packing of T-cuts.
Discret. Math.
Frieda Granot, Michal Penn
1995 J jnl
on the Integral Dicycle Packings and Covers and the Linear ordering Polytope.
Discret. Appl. Math.
Zeev Nutov, Michal Penn
1993 J jnl
A Fast Algorithm for Maximum Integral Two-Commodity Flow in Planar Graphs.
Discret. Appl. Math.
Ephraim Korach, Michal Penn
1993 B conf
On the (integral) maximum tw flow in vertex and edge capacitated planar graphs.
IPCO
Frieda Granot, Michal Penn
1992 J jnl
On the integral plane two-commodity flow problem.
Oper. Res. Lett.
Frieda Granot, Michal Penn
1992 J jnl
Tight integral duality gap in the Chinese Postman problem.
Math. Program.
Ephraim Korach, Michal Penn