Refael Hassin

Justo Puerto

Ann. Oper. Res., September, 2024

On partitioning minimum spanning trees.

[BibT_eX]

[DOI]

Michal Stern

Discret. Appl. Math., 2024

2023

Queueing with Negative Network Effects.

[BibT_eX]

[DOI]

Isaac Meilijson

Yael Perlman

Manuf. Serv. Oper. Manag., September, 2023

How Advance Sales Can Reduce Profits: When to Buy, When to Sell, and What Price to Charge.

[BibT_eX]

[DOI]

Irit Nowik

Manuf. Serv. Oper. Manag., September, 2023

Strategic behavior in queues with arrival rate uncertainty.

[BibT_eX]

[DOI]

Binyamin Oz

Eur. J. Oper. Res., August, 2023

2022

Profit maximization and cost balancing in queueing systems.

[BibT_eX]

[DOI]

Queueing Syst. Theory Appl., 2022

On equilibrium threshold strategies when choosing between observable and unobservable queues.

[BibT_eX]

[DOI]

Nimrod Dvir

Oper. Res. Lett., 2022

Integrality in the multinetwork min-cost equal-flow problem.

[BibT_eX]

[DOI]

Renata Poznanski

Networks, 2022

2021

Greedy Differencing Edge-Contraction heuristic for the Max-Cut problem.

[BibT_eX]

[DOI]

Nikita Leshenko

Oper. Res. Lett., 2021

Rational joining behavior in a queueing system with abandonments.

[BibT_eX]

[DOI]

Michal Benelli

Oper. Res. Lett., 2021

On Queue-Length Information when Customers Travel to a Queue.

[BibT_eX]

[DOI]

Manuf. Serv. Oper. Manag., 2021

Self-Selected Task Allocation.

[BibT_eX]

[DOI]

Adam Nathaniel

Manuf. Serv. Oper. Manag., 2021

Equilibrium and optimal one-shot delegated search.

[BibT_eX]

[DOI]

IISE Trans., 2021

Inefficiency in stochastic queueing systems with strategic customers.

[BibT_eX]

[DOI]

Souvik Ghosh

Eur. J. Oper. Res., 2021

2020

Strategic behaviour in a tandem queue with alternating server.

[BibT_eX]

[DOI]

Nimrod Dvir

Uri Yechiali

Queueing Syst. Theory Appl., 2020

Social and Monopoly Optimization in Observable Queues.

[BibT_eX]

[DOI]

Ran I. Snitkovsky

Oper. Res., 2020

The Approximability of Multiple Facility Location on Directed Networks with Random Arc Failures.

[BibT_eX]

[DOI]

Algorithmica, 2020

2019

On Rational Behavior in a Loss System with One Observable Queue and One Unobservable Queue.

[BibT_eX]

[DOI]

Jonathan H. P. Milo

Proceedings of the Queueing Theory and Network Applications, 2019

A Closed Queueing Network with Strategic Service Differentiation.

[BibT_eX]

[DOI]

Michal Benelli

Proceedings of the Queueing Theory and Network Applications, 2019

2018

Operations research applications of dichotomous search.

[BibT_eX]

[DOI]

Anna Sarid

Eur. J. Oper. Res., 2018

Cascade equilibrium strategies in a two-server queueing system with inspection cost.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2018

On the price of anarchy in a single-server queue with heterogeneous service valuations induced by travel costs.

[BibT_eX]

[DOI]

Irit Nowik

Yair Y. Shaki

Eur. J. Oper. Res., 2018

2017

Strategic customer behavior in a queueing system with a loss subsystem.

[BibT_eX]

[DOI]

Ran I. Snitkovsky

Queueing Syst. Theory Appl., 2017

Customer equilibrium in a single-server system with virtual and system queues.

[BibT_eX]

[DOI]

Roei Engel

Queueing Syst. Theory Appl., 2017

Profit maximization in the M/M/1 queue.

[BibT_eX]

[DOI]

Alexandra Koshman-Kaz

Oper. Res. Lett., 2017

Multiple facility location on a network with linear reliability order of edges.

[BibT_eX]

[DOI]

F. Sibel Salman

J. Comb. Optim., 2017

The Impact of Inspection Cost on Equilibrium, Revenue, and Social Welfare in a Single-Server Queue.

[BibT_eX]

[DOI]

Oper. Res., 2017

Equilibrium and efficient clustering of arrival times to a queue.

[BibT_eX]

[DOI]

Liron Ravner

CoRR, 2017

Self, Social and Monopoly Optimization in Observable Queues.

[BibT_eX]

[DOI]

Ran I. Snitkovsky

Proceedings of the 11th EAI International Conference on Performance Evaluation Methodologies and Tools, 2017

2015

Strategic Overtaking in a Monopolistic M/M/1 Queue.

[BibT_eX]

[DOI]

Jenny Erlichman

IEEE Trans. Autom. Control., 2015

Sequential scheduling on identical machines.

[BibT_eX]

[DOI]

Uri Yovel

Oper. Res. Lett., 2015

Equilibrium strategies for placing duplicate orders in a single server queue.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2015

Optimal Control of a Queue With High-Low Delay Announcements: The Significance of the Queue.

[BibT_eX]

[DOI]

Alexandra Koshman-Kaz

EAI Endorsed Trans. Energy Web, 2015

2014

The Price of Anarchy in the Markovian Single Server Queue.

[BibT_eX]

[DOI]

Gail Gilboa-Freedman

Yoav Kerner

IEEE Trans. Autom. Control., 2014

Regulation under partial cooperation: The case of a queueing system.

[BibT_eX]

[DOI]

Gail Gilboa-Freedman

Oper. Res. Lett., 2014

2013

On the advantage of leadership in service pricing competition.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2013

A local search algorithm for binary maximum 2-path partitioning.

[BibT_eX]

[DOI]

Ohad Schneider

Discret. Optim., 2013

2012

Series-parallel orientations preserving the cycle-radius.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2012

Strategic behavior and social optimization in Markovian vacation queues: The case of heterogeneous customers.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2012

The (K, k)-capacitated spanning tree problem.

[BibT_eX]

[DOI]

Discret. Optim., 2012

Information cascades in a queueing system with parallel servers.

[BibT_eX]

[DOI]

Proceedings of the 6th International ICST Conference on Performance Evaluation Methodologies and Tools, 2012

2011

Strategic Behavior and Social Optimization in Markovian Vacation Queues.

[BibT_eX]

[DOI]

Oper. Res., 2011

On coloring the arcs of a tournament, covering shortest paths, and reducing the diameter of a graph.

[BibT_eX]

[DOI]

Discret. Optim., 2011

Minimum diameter and cycle-diameter orientations on planar graphs

[BibT_eX]

[DOI]

CoRR, 2011

2010

On two restricted ancestors tree problems.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2010

Inducing search by periodic advertising.

[BibT_eX]

[DOI]

Inf. Econ. Policy, 2010

Min sum clustering with penalties.

[BibT_eX]

[DOI]

Einat Or

Eur. J. Oper. Res., 2010

The Complexity of Bottleneck Labeled Graph Problems.

[BibT_eX]

[DOI]

Algorithmica, 2010

Multi-Color Pebble Motion on Graphs.

[BibT_eX]

[DOI]

Gilad Goraly

Algorithmica, 2010

The (K, k)-Capacitated Spanning Tree Problem.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Aspects in Information and Management, 2010

2009

Approximating the minimum quadratic assignment problems.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2009

Equilibrium customers' choice between FCFS and random servers.

[BibT_eX]

[DOI]

Queueing Syst. Theory Appl., 2009

The use of relative priorities in optimizing the performance of a queueing system.

[BibT_eX]

[DOI]

Justo Puerto

Francisco R. Fernández

Eur. J. Oper. Res., 2009

Approximation algorithms for maximum latency and partial cycle cover.

[BibT_eX]

[DOI]

Discret. Optim., 2009

Equilibrium solutions in the observable M/M/1 queue with overtaking.

[BibT_eX]

[DOI]

Jenny Erlichman

Proceedings of the 4th International Conference on Performance Evaluation Methodologies and Tools, 2009

Tractable Cases of Facility Location on a Network with a Linear Reliability Order of Links.

[BibT_eX]

[DOI]

F. Sibel Salman

Proceedings of the Algorithms, 2009

2008

Rounding to an integral program.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2008

Greedy heuristics with regret, with application to the cheapest insertion algorithm for the TSP.

[BibT_eX]

[DOI]

Ariel Keinan

Oper. Res. Lett., 2008

Scheduling Arrivals to Queues: A Single-Server Model with No-Shows.

[BibT_eX]

[DOI]

Sharon Mendel

Manag. Sci., 2008

The k-path tree matroid and its applications to survivable network design.

[BibT_eX]

[DOI]

Discret. Optim., 2008

2007

Approximation algorithms and hardness results for labeled connectivity problems.

[BibT_eX]

[DOI]

J. Comb. Optim., 2007

Flow trees for vertex-capacitated networks.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2007

2006

Robust subgraphs for trees and paths.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2006

The minimum generalized vertex cover problem.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2006

Who should be given priority in a queue?

[BibT_eX]

[DOI]

Oper. Res. Lett., 2006

Approximations for minimum and min-max vehicle routing problems.

[BibT_eX]

[DOI]

J. Algorithms, 2006

An improved approximation algorithm for the metric maximum clustering problem with given cluster sizes.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2006

Optimizing Chemotherapy Scheduling Using Local Search Heuristics.

[BibT_eX]

[DOI]

Zvia Agur

Sigal Levy

Oper. Res., 2006

Erratum to "An approximation algorithm for maximum triangle packing": [Discrete Applied Mathematics 154 (2006) 971-979].

[BibT_eX]

[DOI]

Discret. Appl. Math., 2006

An approximation algorithm for maximum triangle packing.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2006

A Maximum Profit Coverage Algorithm with Application to Small Molecules Cluster Identification.

[BibT_eX]

[DOI]

Einat Or

Proceedings of the Experimental Algorithms, 5th International Workshop, 2006

2005

A Better-Than-Greedy Approximation Algorithm for the Minimum Set Cover Problem.

[BibT_eX]

[DOI]

SIAM J. Comput., 2005

Equilibrium in Queueing Systems with Complementary Products.

[BibT_eX]

[DOI]

Ari Veltman

Queueing Syst. Theory Appl., 2005

On the complexity of the k-customer vehicle routing problem.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2005

The maximum saving partition problem.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2005

The Number of Solutions Sufficient for Solving a Family of Problems.

[BibT_eX]

[DOI]

Ori Einstein

Math. Oper. Res., 2005

Approximation algorithms for some vehicle routing problems.

[BibT_eX]

[DOI]

Cristina Bazgan

Discret. Appl. Math., 2005

Machine scheduling with earliness, tardiness and non-execution penalties.

[BibT_eX]

[DOI]

Mati Shani

Comput. Oper. Res., 2005

Approximation Algorithms for Quickest Spanning Tree Problems.

[BibT_eX]

[DOI]

Algorithmica, 2005

The Multi-radius Cover Problem.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures, 9th International Workshop, 2005

The Set Cover with Pairs Problem.

[BibT_eX]

[DOI]

Proceedings of the FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science, 2005

An Approximation Algorithm for the Minimum Latency Set Cover Problem.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2005

2004

An efficient polynomial time approximation scheme for the constrained minimum spanning tree problem using matroid intersection.

[BibT_eX]

[DOI]

SIAM J. Comput., 2004

Synthesis of 2-Commodity Flow Networks.

[BibT_eX]

[DOI]

Math. Oper. Res., 2004

Minimum restricted diameter spanning trees.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2004

Approximation Algorithms for a Capacitated Network Design Problem.

[BibT_eX]

[DOI]

F. Sibel Salman

Algorithmica, 2004

Approximations for Maximum Transportation with Permutable Supply Vector and Other Capacitated Star Packing Problems.

[BibT_eX]

[DOI]

Algorithmica, 2004

2003

Approximation algorithms for the metric maximum clustering problem with given cluster sizes.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2003

Reconstructing edge-disjoint paths.

[BibT_eX]

[DOI]

Michele Conforti

Oper. Res. Lett., 2003

Minimum spanning tree with hop restrictions.

[BibT_eX]

[DOI]

J. Algorithms, 2003

Capacitated vertex covering.

[BibT_eX]

[DOI]

J. Algorithms, 2003

Lexicographic local search and the p.

[BibT_eX]

[DOI]

Dana Morad

Eur. J. Oper. Res., 2003

Subgraphs decomposable into two trees and k-edge-connected subgraphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2003

Differential Approximation for Some Routing Problems.

[BibT_eX]

[DOI]

Cristina Bazgan

Proceedings of the Algorithms and Complexity, 5th Italian Conference, 2003

2002

Robust Matchings.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2002

Approximation algorithms for constructing wavelength routing networks.

[BibT_eX]

[DOI]

Networks, 2002

A 7/8-approximation algorithm for metric Max TSP.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2002

Complexity of finding dense subgraphs.

[BibT_eX]

[DOI]

Yuichi Asahiro

Kazuo Iwama

Discret. Appl. Math., 2002

Increasing digraph arc-connectivity by arc addition, reversal and complement.

[BibT_eX]

[DOI]

Shimon Shahar

Discret. Appl. Math., 2002

A note on orientations of mixed graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2002

Nash Equilibrium and Subgame Perfection in Observable Queues.

[BibT_eX]

[DOI]

Ann. Oper. Res., 2002

Approximations for Maximum Transportation Problem with Permutable Supply Vector and Other Capacitated Star Packing Problems.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Theory, 2002

Capacitated vertex covering with applications.

[BibT_eX]

[DOI]

Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

2001

A 0.5-Approximation Algorithm for MAX DICUT with Given Sizes of Parts.

[BibT_eX]

[DOI]

Alexander A. Ageev

SIAM J. Discret. Math., 2001

z-Approximations.

[BibT_eX]

[DOI]

Samir Khuller

J. Algorithms, 2001

Approximation algorithms for maximum linear arrangement.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2001

Approximating the maximum quadratic assignment problem.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2001

2000

Minimum-diameter covering problems.

[BibT_eX]

[DOI]

Networks, 2000

Better approximations for max TSP.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2000

Approximation Algorithms with Bounded Performance Guarantees for the Clustered Traveling Salesman Problem.

[BibT_eX]

[DOI]

Algorithmica, 2000

Approximation Algorithms for Minimum K-Cut.

[BibT_eX]

[DOI]

Algorithmica, 2000

Robust Matchings and Maximum Clustering.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Theory, 2000

Approximating the maximum quadratic assignment problem.

[BibT_eX]

[DOI]

Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

An approximation algorithm for MAX DICUT with given sizes of parts.

[BibT_eX]

[DOI]

Alexander A. Ageev

Proceedings of the Approximation Algorithms for Combinatorial Optimization, 2000

1999

Scheduling maintenance services to three machines.

[BibT_eX]

[DOI]

Celia A. Glass

Ann. Oper. Res., 1999

1998

On Local Search for Weighted k-Set Packing.

[BibT_eX]

[DOI]

Math. Oper. Res., 1998

An Approximation Algorithm for the Maximum Traveling Salesman Problem.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1998

Graph partitions with minimum degree constraints.

[BibT_eX]

[DOI]

Discret. Math., 1998

Approximation Algorithms for Min-sum p-clustering.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1998

Approximation Algorithms for Minimum Tree Partition.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1998

The Scheduling of Maintenance Service.

[BibT_eX]

[DOI]

Celia A. Glass

Discret. Appl. Math., 1998

1997

Approximation algorithms for maximum dispersion.

[BibT_eX]

[DOI]

Oper. Res. Lett., 1997

Restricted delivery problems on a network.

[BibT_eX]

[DOI]

Limor Klein

Networks, 1997

Approximation Algorithms for Min-Max Tree Partition.

[BibT_eX]

[DOI]

J. Algorithms, 1997

An Approximation Algorithm for Maximum Packing of 3-Edge Paths.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1997

Equilibrium Threshold Strategies: The Case of Queues with Priorities.

[BibT_eX]

[DOI]

Oper. Res., 1997

On Local Search for Weighted k-Set Packing.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 1997

1996

A Flow Algorithm for Network Synchronization.

[BibT_eX]

[DOI]

Oper. Res., 1996

1995

Equilibrium strategies for queues with impatient customers.

[BibT_eX]

[DOI]

Oper. Res. Lett., 1995

On the Minimum Diameter Spanning Tree Problem.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1995

optimal Separable Partitioning in the Plane.

[BibT_eX]

[DOI]

Michal Benelli

Discret. Appl. Math., 1995

1994

Approximations for the Maximum Acyclic Subgraph Problem.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1994

Maximizing the Number of Unused Colors in the Vertex Coloring Problem.

[BibT_eX]

[DOI]

Shlomo Lahav

Inf. Process. Lett., 1994

Approximation Algorithms for the Geometric Covering Salesman Problem.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1994

1993

Approximating the Tree and Tour Covers of a Graph.

[BibT_eX]

[DOI]

Magnús M. Halldórsson

Inf. Process. Lett., 1993

Monotonicity and Efficient Computation of Optimal Dichotomous Search.

[BibT_eX]

[DOI]

Mordechai I. Henig

Discret. Appl. Math., 1993

1992

Mean Passage Times and Nearly Uncoupled Markov Chains.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 1992

Algorithms for the minimum cost circulation problem based on maximizing the mean improvement.

[BibT_eX]

[DOI]

Oper. Res. Lett., 1992

The swapping problem.

[BibT_eX]

[DOI]

Networks, 1992

Approximation Schemes for the Restricted Shortest Path Problem.

[BibT_eX]

[DOI]

Math. Oper. Res., 1992

1991

Improved complexity bounds for location problems on the real line.

[BibT_eX]

[DOI]

Oper. Res. Lett., 1991

Exact Computation of Optimal Inventory Policies Over an Unbounded Horizon.

[BibT_eX]

[DOI]

Nimrod Megiddo

Math. Oper. Res., 1991

Approximation algorithms for hitting objects with straight lines.

[BibT_eX]

[DOI]

Nimrod Megiddo

Discret. Appl. Math., 1991

Multiterminal xcut problems.

[BibT_eX]

[DOI]

Ann. Oper. Res., 1991

1990

Simultaneous Solution of Families of Problems.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 1990

1989

Ranking the Best Binary Trees.

[BibT_eX]

[DOI]

SIAM J. Comput., 1989

Maximizing Classes of Two-Parameter Objectives Over Matroids.

[BibT_eX]

[DOI]

Math. Oper. Res., 1989

1988

Probabilistic Analysis of the Capacitated Transportation Problem.

[BibT_eX]

[DOI]

Eitan Zemel

Math. Oper. Res., 1988

Solution Bases of Multiterminal Cut Problems.

[BibT_eX]

[DOI]

Math. Oper. Res., 1988

1987

Equilibrium Arrivals in Queues with Bulk Service at Scheduled Times.

[BibT_eX]

[DOI]

Transp. Sci., 1987

1986

A Deterministic Single-Item Inventory Model with Seller Holding Cost and Buyer Holding and Shortage Costs.

[BibT_eX]

[DOI]

Oper. Res., 1986

Multi-terminal maximum flows in node-capacitated networks.

[BibT_eX]

[DOI]

Frieda Granot

Discret. Appl. Math., 1986

1985

An O(n log2 n) Algorithm for Maximum Flow in Undirected Planar Networks.

[BibT_eX]

[DOI]

Donald B. Johnson

SIAM J. Comput., 1985

On Shortest Paths in Graphs with Random Weights.

[BibT_eX]

[DOI]

Eitan Zemel

Math. Oper. Res., 1985

An Optimal Algorithm for Finding all the Jumps of a Monotone Step-Function.

[BibT_eX]

[DOI]

Nimrod Megiddo

J. Algorithms, 1985

1984

On multicommodity flows in planar graphs.

[BibT_eX]

[DOI]

Networks, 1984

Dichotomous Search for Random Objects on an Interval.

[BibT_eX]

[DOI]

Mordechai I. Henig

Math. Oper. Res., 1984

A Dichotomous Search for a Geometric Random Variable.

[BibT_eX]

[DOI]

Oper. Res., 1984

1983

The minimum cost flow problem: A unifying approach to dual algorithms and a new tree-search algorithm.

[BibT_eX]

[DOI]

Math. Program., 1983

1982

Minimum cost flow with set-constraints.

[BibT_eX]

[DOI]

Networks, 1982

1981

Generalizations of Hoffman's existence theorem for circulations.

[BibT_eX]

[DOI]

Networks, 1981

Maximum Flow in (s, t) Planar Networks.

[BibT_eX]

[DOI]