S. Raghavan

Manuf. Serv. Oper. Manag., January, 2024

2023

The rendezvous vehicle routing problem.

[BibT_eX]

[DOI]

Eric Oden

Optim. Lett., November, 2023

Improving Broader Sharing to Address Geographic Inequity in Liver Transplantation.

[BibT_eX]

[DOI]

Shubham Akshat

Liye Ma

Manuf. Serv. Oper. Manag., July, 2023

2022

Rapid Influence Maximization on Social Networks: The Positive Influence Dominating Set Problem.

[BibT_eX]

[DOI]

INFORMS J. Comput., 2022

Influence Maximization with Latency Requirements on Social Networks.

[BibT_eX]

[DOI]

INFORMS J. Comput., 2022

2021

Weighted target set selection on trees and cycles.

[BibT_eX]

[DOI]

Networks, 2021

Preface.

[BibT_eX]

[DOI]

J. Cole Smith

Networks, 2021

2020

A branch-and-cut approach for the least cost influence problem on social networks.

[BibT_eX]

[DOI]

Dilek Günneç

Networks, 2020

Least-Cost Influence Maximization on Social Networks.

[BibT_eX]

[DOI]

Dilek Günneç

INFORMS J. Comput., 2020

2019

A Branch-and-Cut Approach for the Weighted Target Set Selection Problem on Social Networks.

[BibT_eX]

[DOI]

INFORMS J. Optim., October, 2019

The capacitated mobile facility location problem.

[BibT_eX]

[DOI]

Mustafa Sahin

F. Sibel Salman

Eur. J. Oper. Res., 2019

2017

An inexact sample average approximation approach for the stochastic connected facility location problem.

[BibT_eX]

[DOI]

Networks, 2017

Integrating Social Network Effects in the Share-Of-Choice Problem.

[BibT_eX]

[DOI]

Dilek Günneç

Decis. Sci., 2017

2016

Approximate robust optimization for the Connected Facility Location problem.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2016

2015

Efficient Edge-swapping heuristics for the reload cost spanning tree problem.

[BibT_eX]

[DOI]

Mustafa Sahin

Networks, 2015

The Generalized Regenerator Location Problem.

[BibT_eX]

[DOI]

Si Chen

Ivana Ljubic

INFORMS J. Comput., 2015

The Recoverable Robust Two-Level Network Design Problem.

[BibT_eX]

[DOI]

Eduardo Álvarez-Miranda

Ivana Ljubic

Paolo Toth

INFORMS J. Comput., 2015

Local search heuristics for the mobile facility location problem.

[BibT_eX]

[DOI]

Russell D. Halper

Mustafa Sahin

Comput. Oper. Res., 2015

2014

How to influence people with partial incentives.

[BibT_eX]

[DOI]

Erik D. Demaine

MohammadTaghi Hajiaghayi

Morteza Zadimoghaddam

Proceedings of the 23rd International World Wide Web Conference, 2014

2013

Designing WDM Optical Networks Using Branch-and-Price.

[BibT_eX]

[DOI]

J. Math. Model. Algorithms Oper. Res., 2013

Robust Optimization for the Connected Facility Location Problem.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2013

2012

Reload cost trees and network design.

[BibT_eX]

[DOI]

Luis Eduardo Neves Gouveia

Networks, 2012

The Generalized Covering Salesman Problem.

[BibT_eX]

[DOI]

INFORMS J. Comput., 2012

Multi-period traffic routing in satellite networks.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2012

2011

The Mobile Facility Routing Problem.

[BibT_eX]

[DOI]

Russell D. Halper

Transp. Sci., 2011

Branch and Price for WDM Optical Networks with No Bifurcation of Flow.

[BibT_eX]

[DOI]

INFORMS J. Comput., 2011

2010

The regenerator location problem.

[BibT_eX]

[DOI]

Si Chen

Ivana Ljubic

Networks, 2010

Dual-Based Local Search for the Connected Facility Location and Related Problems.

[BibT_eX]

[DOI]

INFORMS J. Comput., 2010

Variable neighborhood search for the cost constrained minimum label spanning tree and label constrained minimum spanning tree problems.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2010

2009

Matrix Bidding in Combinatorial Auctions.

[BibT_eX]

[DOI]

Oper. Res., 2009

2008

The prize-collecting generalized minimum spanning tree problem.

[BibT_eX]

[DOI]

J. Heuristics, 2008

A combinatorial procurement auction featuring bundle price revelation without free-riding.

[BibT_eX]

[DOI]

Decis. Support Syst., 2008

2007

Computing core payments in combinatorial auctions.

[BibT_eX]

[DOI]

SIGecom Exch., 2007

Fair Payments for Efficient Allocations in Public Sector Combinatorial Auctions.

[BibT_eX]

[DOI]

Manag. Sci., 2007

2006

Investment Analysis and Budget Allocation at Catholic Relief Services.

[BibT_eX]

[DOI]

Richard Nidel

Interfaces, 2006

The Multilevel Capacitated Minimum Spanning Tree Problem.

[BibT_eX]

[DOI]

INFORMS J. Comput., 2006

Diversification for better classification trees.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2006

A divide-and-conquer local search heuristic for data visualization.

[BibT_eX]

[DOI]

Roselyn Abbiw-Jackson

Edward A. Wasil

Comput. Oper. Res., 2006

2005

Strong formulations for network design problems with connectivity requirements.

[BibT_eX]

[DOI]

Thomas L. Magnanti

Networks, 2005

Introduction to the Special Issue on Electronic Markets.

[BibT_eX]

G. Anandalingam

Manag. Sci., 2005

The Landscape of Electronic Market Design.

[BibT_eX]

[DOI]

G. Anandalingam

Manag. Sci., 2005

Heuristic Search for the Generalized Minimum Spanning Tree Problem.

[BibT_eX]

[DOI]

INFORMS J. Comput., 2005

2004

Low-connectivity network design on series-parallel graphs.

[BibT_eX]

[DOI]

Networks, 2004

Long-Distance Access Network Design.

[BibT_eX]

[DOI]

Rosemary T. Berger

Manag. Sci., 2004

2003

Genetically Engineered Decision Trees: Population Diversity Produces Smarter Trees.

[BibT_eX]

[DOI]

Oper. Res., 2003

A Genetic Algorithm-Based Approach for Building Accurate Decision Trees.

[BibT_eX]

[DOI]

INFORMS J. Comput., 2003

2002

A visualization model based on adjacency data.

[BibT_eX]

[DOI]

Decis. Support Syst., 2002

1995

Formulations and algorithms for network design problems with connectivity requirements.

[BibT_eX]

[DOI]