Michal Penn

发表

Constrained multi-object auctions and b-matching

Moshe Tennenholtz, Michal Penn, Moshe Tennenholtz, 2000, Inf. Process. Lett..

Asynchronous Congestion Games

Moshe Tennenholtz, Maria Polukarov, Michal Penn, 2009, Graph Theory, Computational Intelligence and Thought.

Optimal Allocation of Proposals to Reviewers to Facilitate Effective Ranking

Boaz Golany, Wade D. Cook, Moshe Kress, 2005, Manag. Sci..

Random Order Congestion Games

Moshe Tennenholtz, Maria Polukarov, Michal Penn, 2009, Math. Oper. Res..

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

Ephraim Korach, Michal Penn, 1993, Discret. Appl. Math..

On the integral 4-packing of T-cuts

Frieda Granot, Michal Penn, 1995, Discret. Math..

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

Michal Penn, Hagai Glicksman, M. Penn, 2008, Discret. Appl. Math..

Taxed congestion games with failures

Moshe Tennenholtz, Maria Polukarov, Michal Penn, 2009, Annals of Mathematics and Artificial Intelligence.

Considerate Equilibrium

Martin Hoefer, Maria Polukarov, Berthold Vöcking, 2011, IJCAI.

Scheduling jobshops with some identical or similar jobs

Gideon Weiss, Michal Penn, Tami Boudoukh, 2001 .

An extended planar algorithm for maximum integral two-flow

Michal Penn, Raanan Manor, 1998, Networks.

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

Frieda Granot, Michal Penn, 1993, IPCO.

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

Gregory Levitin, Michal Penn, Opher Dubrovsky, 2002, J. Heuristics.

Editorial

Joseph Naor, Uriel G. Rothblum, Michal Penn, 2008, Discret. Appl. Math..

Disconnecting sets in single and two-terminal-pair networks

Maurice Queyranne, Frieda Granot, Michal Penn, 1996, Networks.

Exact and approximate solutions of the container ship stowage problem

Mordecai Avriel, Michal Penn, M. Avriel, 1993 .

Congestion games with load-dependent failures: identical resources

Moshe Tennenholtz, Maria Polukarov, Michal Penn, 2007, EC '07.

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

Joseph Naor, Uriel G. Rothblum, Michal Penn, 2008, Discret. Appl. Math..

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

Boaz Golany, Wade D. Cook, Tal Raviv, 2007, Comput. Oper. Res..

Asynchronous Congestion Games

Moshe Tennenholtz, Maria Polukarov, Michal Penn, 2008, Graph Theory, Computational Intelligence and Thought.

On Integrality, Stability and Composition of Dicycle Packings and Covers

Zeev Nutov, Michal Penn, Zeev Nutov, 2000, J. Comb. Optim..

Faster approximation algorithms for weighted triconnectivity augmentation problems

Zeev Nutov, Michal Penn, 1997, Oper. Res. Lett..

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

Mordecai Avriel, Michal Penn, Naomi Shpirer, 2000, Discret. Appl. Math..

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

Tal Raviv, Michal Penn, 2008, Discret. Appl. Math..

Process planning for rotational parts using the generalized travelling salesman problem

David Ben-Arieh, Anders Yeo, Michal Penn, 2003 .

Optimizing the quality control station configuration

Tal Raviv, Michal Penn, 2007 .

Approximation algorithm for the group Steiner network problem

Michal Penn, Stas Rozenfeld, M. Penn, 2007, Networks.

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

Michal Penn, Haya Shasha-Krupnik, 1997, J. Algorithms.

Congestion games with failures

Moshe Tennenholtz, Maria Polukarov, Michal Penn, 2011, Discret. Appl. Math..

An algorithm for the maximum revenue jobshop problem

Tal Raviv, Michal Penn, 2009, Eur. J. Oper. Res..

Tight integral duality gap in the Chinese Postman problem

Ephraim Korach, Michal Penn, E. Korach, 1992, Math. Program..

Cyclic-routing of Unmanned Aerial Vehicles

Ofer Strichman, Nir Drucker, Michal Penn, 2019, J. Comput. Syst. Sci..

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

Zeev Nutov, Michal Penn, 1995, Discret. Appl. Math..

Stowage planning for container ships to reduce the number of shifts

Mordecai Avriel, Michal Penn, Naomi Shpirer, 1998, Ann. Oper. Res..

Network Optimization Models for Resource Allocation in Developing Military Countermeasures

Uriel G. Rothblum, Boaz Golany, Moshe Kress, 2012, Oper. Res..

On Multi-Object Auctions and Matching Theory: Algorithmic Aspects

Moshe Tennenholtz, Michal Penn, Moshe Tennenholtz, 2005 .

Approximation algorithm for minimizing total latency in machine scheduling with deliveries

Asaf Levin, Michal Penn, Asaf Levin, 2008, Discret. Optim..

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

Frieda Granot, Michal Penn, 1996, Discret. Appl. Math..

On the integral plane two-commodity flow problem

Frieda Granot, Michal Penn, 1992, Oper. Res. Lett..

Cyclic-routing of Unmanned Aerial Vehicles

Joël Ouaknine, Ofer Strichman, Hsi-Ming Ho, 2019, J. Comput. Syst. Sci..

Congestion games with load-dependent failures: Identical resources

Moshe Tennenholtz, Maria Polukarov, Michal Penn, 2009, Games Econ. Behav..

Congestion games with failures

Moshe Tennenholtz, Maria Polukarov, Michal Penn, 2005, EC '05.

Scheduling appointments via fluids control

Avishai Mandelbaum, Michal Penn, Yossef Luzon, 2009, 2009 International Conference on Model-Based Systems Engineering.

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

Tal Raviv, Michal Penn, T. Raviv, 2021, J. Sched..

On Mobile Robots Flow In Locally Uniform Networks

Zeev Nutov, Michal Penn, David Sinreich, 1997 .

Doubly stochastic matrices and dicycle covers and packings in eulerian digraphs

Alberto Borobia, Zeev Nutov, Michal Penn, 1996 .

An extended planar algorithm for maximum integral two‐flow

Michal Penn, Raanan Manor, 1998 .

Disconnecting sets in single and two‐terminal‐pair networks

Maurice Queyranne, Frieda Granot, Michal Penn, 1996 .

The minmax multidimensional knapsack problem with application to a chance‐constrained problem

Maria Polukarov, Moshe Kress, Michal Penn, 2007 .

On non-{0, 1/2, 1} extreme points of the generalized transitive tournament polytope

Zeev Nutov, Michal Penn, 1996 .

Characterizations of naturally submodular graphs: a polynomially solvable class of the TSP

Yale T. Herer, Michal Penn, Y. Herer, 1995 .