The following pages link to Michal Penn (Q210307):
Displaying 42 items.
- (Q294789) (redirect page) (← links)
- Constrained multi-object auctions and \(b\)-matching (Q294790) (← links)
- (Q588715) (redirect page) (← links)
- Congestion games with failures (Q642974) (← links)
- Congestion games with load-dependent failures: Identical resources (Q834859) (← links)
- Creating a consensus ranking of proposals from reviewers' partial ordinal rankings (Q856671) (← links)
- Approximation algorithm for minimizing total latency in machine scheduling with deliveries (Q924636) (← links)
- An algorithm for the maximum revenue jobshop problem (Q958087) (← links)
- Approximation algorithms for group prize-collecting and location-routing problems (Q1003471) (← links)
- Tight integral duality gap in the Chinese postman problem (Q1196167) (← links)
- On the integral plane two-commodity flow problem (Q1197891) (← links)
- Faster approximation algorithms for weighted triconnectivity augmentation problems (Q1267191) (← links)
- A fast algorithm for maximum integral two-commodity flow in planar graphs (Q1314324) (← links)
- Solving the 0-1 proportional knapsack problem by sampling (Q1321464) (← links)
- Stowage planning for container ships to reduce the number of shifts (Q1383119) (← links)
- Container ship stowage problem complexity and connection to the coloring of circle graphs (Q1570840) (← links)
- On integrality, stability and composition of dicycle packings and covers (Q1583704) (← links)
- Doubly stochastic matrices and dicycle covers and packings in Eulerian digraphs (Q1816947) (← links)
- On the integral dicycle packings and covers and the linear ordering polytope (Q1894372) (← links)
- On the integral 4-packing of \(T\)-cuts (Q1896345) (← links)
- On non-\(\{0,{1\over 2},1\}\) extreme points of the generalized transitive tournament polytope (Q1906776) (← links)
- Complexity and algorithms for min cost and max profit scheduling under time-of-use electricity tariffs (Q2061134) (← links)
- Taxed congestion games with failures (Q2268914) (← links)
- Cyclic-routing of unmanned aerial vehicles (Q2424667) (← links)
- A polynomial time algorithm for solving a quality control Station configuration problem (Q2473038) (← links)
- Polynomial algorithms for (integral) maximum two-flows in vertex\(\backslash\)edge-capacitated planar graphs (Q2563924) (← links)
- Cyclic Routing of Unmanned Aerial Vehicles (Q2815100) (← links)
- Network optimization models for resource allocation in developing military countermeasures (Q2892213) (← links)
- NOTE Improved Approximation Algorithms for Weighted 2- and 3-Vertex Connectivity Augmentation Problems (Q3125225) (← links)
- Resource allocation in an asymmetric technology race with temporary advantages (Q3166686) (← links)
- Random Order Congestion Games (Q3169062) (← links)
- (Q3374249) (← links)
- Approximation algorithm for the group Steiner network problem (Q3428914) (← links)
- Asynchronous Congestion Games (Q3655138) (← links)
- (Q4234146) (← links)
- Characterizations of Natural Submodular Graphs: A Polynomially Solvable Class of the TSP (Q4327639) (← links)
- On Mobile Robots Flow In Locally Uniform Networks (Q4380544) (← links)
- An extended planar algorithm for maximum integral two-flow (Q4540065) (← links)
- Disconnecting sets in single and two-terminal-pair networks (Q4887740) (← links)
- Optimizing the quality control station configuration (Q5433533) (← links)
- The minmax multidimensional knapsack problem with application to a chance‐constrained problem (Q5438265) (← links)
- Scheduling jobshops with some identical or similar jobs (Q5946718) (← links)
