Faculty

Institution

Unit

Venue

Dorit Hochbaum

Chancellor full professor

University of California, Berkeley

Affiliations

College of Engineering

Industrial Engineering & Operations Research

Dorit Hochbaum is currently serving as a College Of Engineering Chancellor full professor at University of California, Berkeley.

Honors

Create free account to unlock more features

Experiences

Create free account to unlock more features

Education

Create free account to unlock more features

Dorit Hochbaum

University of California, Berkeley

Chancellor full professor

You can click a keyword to filter the displayed items

applied mathematics computer science mathematical optimization operations research combinatorial optimization machine learning graph theory discrete mathematics optimization problems systems engineering computational optimization approximation theory theoretical computer science approximation algorithms network science scheduling problems computational complexity discrete algorithms mathematical programming mathematics discrete optimization image segmentation graph algorithms engineering optimization scheduling (computing) pseudoflow algorithm management science network optimization nonlinear optimization vehicle routing problems integer optimization polynomial algorithm polynomial algorithms scientific computing operation management network routing algorithm ranking algorithms linear programming scheduling (production processes) random graphs heuristic (computer science) discrete modeling polynomial time algorithms half integrality normalized cut efficient algorithms combinatorial theory nuclear science combinatorial problems extremal graph theory network routing reputation management scheduling analysis network algorithms location estimation complexity theory object tracking video content analysis video manipulation video processing decision trees dual approximation algorithms k-cut problem efficient algorithm related problems allocation problem maximum flow problem multicovering problem ratio regions decision science mobile computing computer-aided design information technology world wide web distributed decision making multiple-criteria decision analysis

Notable Scholarly Works

Notable Federal Grants

Collaborators

A Fast and Effective Breakpoints Heuristic Algorithm for the Quadratic Knapsack Problem. European Journal of Operational Research (2024)

D.S. HochbaumP. BaumannO. GoldschmidtY. Zhang

mathematical optimizationheuristic (computer science)optimization problemsquadratic knapsack problemscheduling problemscombinatorial optimizationapplied mathematicsoperations research

An Algorithm for Clustering With Confidence-Based Must-Link and Cannot-Link Constraints. INFORMS journal on computing (2024)

Philipp BaumannDorit S. Hochbaum

machine learningprobabilistic graph theoryunsupervised machine learningmachine learning researchdata scienceclusteringconfidence-based must-linkcomputer science

Flow is Best, Fast and Scalable: The Incremental Parametric Cut for Maximum Density and Other Ratio Subgraph Problems. (2024)

Dorit Hochbaum

incremental parametric cutmaximum density

Path of Solutions for Fused Lasso Problems. (2024)

Torpong NitayanontCheng LuDorit Hochbaum

fused lasso problemsapplied mathematics

Positive-Unlabeled Learning Using Pairwise Similarity and Parametric Minimum Cuts. (2024)

Torpong NitayanontDorit Hochbaum

parametric minimum cutscomputer sciencemachine learningpairwise similarity

Selecting Fast Algorithms for the Capacitated Vehicle Routing Problem With Machine Learning Techniques. Networks (2024)

Roberto Asín‐AcháAlexis EspinozaOlivier GoldschmidtDorit S. HochbaumIsaías I. Huerta

computational optimizationmachine learningmathematical optimizationoptimization problemsvehicle routing problemsvehicle controlcombinatorial optimizationcomputer sciencecapacitated vehicle

Text-Based Feature-Free Automatic Algorithm Selection. (2024)

Amanda Salinas-PintoBryan Alvarado-UlloaDorit HochbaumMatías Francia-CarramiñanaRicardo ÑanculefRoberto Asín-Achá

feature selectiontext miningnatural language processingpattern recognitioncomputer sciencestring-searching algorithm

Obituary for Professor Emeritus Jakob Kraurp. European Journal of Operational Research (2023)

Anita SchöbelDavid PisingerDorit Hochbaum

systems engineeringoperations research

Unified New Techniques for Np-Hard Budgeted Problems With Applications in Team Collaboration, Pattern Recognition, Document Summarization, Community Detection and Imaging. (2023)

Dorit Hochbaum

collaborative computingsocial network analysisdocument summarizationcommunity detectionreal-time collaborationcomputer scienceteam collaborationinformation fusion

A Better Decision Tree: The Max-Cut Decision Tree With Modified Pca Improves Accuracy and Running Time. SN Computer Science (2022)

Jonathan BodineDorit S. Hochbaum

machine learningmodified pcamax-cut decision treedecision treesrunning timecomputer science

1
2
3
4
5
19
10 / page

Dorit Hochbaum

Chancellor full professor

University of California, Berkeley

Affiliations

College of Engineering

Industrial Engineering & Operations Research

Dorit Hochbaum is currently serving as a College Of Engineering Chancellor full professor at University of California, Berkeley.

Honors

Create free account to unlock more features

Experiences

Create free account to unlock more features

Education

Create free account to unlock more features

Dorit Hochbaum

University of California, Berkeley

Chancellor full professor

You can click a keyword to filter the displayed items

Notable Scholarly Works

Notable Federal Grants

Collaborators

A Fast and Effective Breakpoints Heuristic Algorithm for the Quadratic Knapsack Problem. European Journal of Operational Research (2024)

D.S. HochbaumP. BaumannO. GoldschmidtY. Zhang

mathematical optimizationheuristic (computer science)optimization problemsquadratic knapsack problemscheduling problemscombinatorial optimizationapplied mathematicsoperations research

An Algorithm for Clustering With Confidence-Based Must-Link and Cannot-Link Constraints. INFORMS journal on computing (2024)

Philipp BaumannDorit S. Hochbaum

machine learningprobabilistic graph theoryunsupervised machine learningmachine learning researchdata scienceclusteringconfidence-based must-linkcomputer science

Flow is Best, Fast and Scalable: The Incremental Parametric Cut for Maximum Density and Other Ratio Subgraph Problems. (2024)

Dorit Hochbaum

incremental parametric cutmaximum density

Path of Solutions for Fused Lasso Problems. (2024)

Torpong NitayanontCheng LuDorit Hochbaum

fused lasso problemsapplied mathematics

Positive-Unlabeled Learning Using Pairwise Similarity and Parametric Minimum Cuts. (2024)

Torpong NitayanontDorit Hochbaum

parametric minimum cutscomputer sciencemachine learningpairwise similarity

Selecting Fast Algorithms for the Capacitated Vehicle Routing Problem With Machine Learning Techniques. Networks (2024)

Roberto Asín‐AcháAlexis EspinozaOlivier GoldschmidtDorit S. HochbaumIsaías I. Huerta

computational optimizationmachine learningmathematical optimizationoptimization problemsvehicle routing problemsvehicle controlcombinatorial optimizationcomputer sciencecapacitated vehicle

Text-Based Feature-Free Automatic Algorithm Selection. (2024)

Amanda Salinas-PintoBryan Alvarado-UlloaDorit HochbaumMatías Francia-CarramiñanaRicardo ÑanculefRoberto Asín-Achá

feature selectiontext miningnatural language processingpattern recognitioncomputer sciencestring-searching algorithm

Obituary for Professor Emeritus Jakob Kraurp. European Journal of Operational Research (2023)

Anita SchöbelDavid PisingerDorit Hochbaum

systems engineeringoperations research

Unified New Techniques for Np-Hard Budgeted Problems With Applications in Team Collaboration, Pattern Recognition, Document Summarization, Community Detection and Imaging. (2023)

Dorit Hochbaum

collaborative computingsocial network analysisdocument summarizationcommunity detectionreal-time collaborationcomputer scienceteam collaborationinformation fusion

A Better Decision Tree: The Max-Cut Decision Tree With Modified Pca Improves Accuracy and Running Time. SN Computer Science (2022)

Jonathan BodineDorit S. Hochbaum

machine learningmodified pcamax-cut decision treedecision treesrunning timecomputer science

1
2
3
4
5
19
10 / page

Similar Faculty Members

David P. Williamson

Institution

Cornell University

network science

network algorithm

David B. Shmoys

Institution

Cornell University

algorithm design

computational engineering

Samir Khuller

Institution

Northwestern University

computer science

applied mathematics

Sanjeev Khanna

Institution

University of Pennsylvania

discrete algorithm

combinatorial problem

Mohammad Hajiaghayi

Institution

University of Maryland, College Park

computer science

applied mathematics

Aravind Srinivasan

Institution

University of Maryland, College Park

computer science

applied mathematics

Chandra Sekhar Chekuri

Institution

University of Illinois Urbana-Champaign

analysis of algorithm

applied mathematics

Samir Khuller

Institution

University of Maryland, College Park

parallel complexity theory

combinatorial optimization

S. S. Iyengar

Institution

Florida International University

industrial informatics

parallel computing

Joseph S. B. Mitchell

Institution

Stony Brook University

air traffic management

vehicle routing problem

Similar Faculty Members

David P. Williamson

Institution

Cornell University

network science

network algorithm

David B. Shmoys

Institution

Cornell University

algorithm design

computational engineering

Samir Khuller

Institution

Northwestern University

computer science

applied mathematics

Sanjeev Khanna

Institution

University of Pennsylvania

discrete algorithm

combinatorial problem

Mohammad Hajiaghayi

Institution

University of Maryland, College Park

computer science

applied mathematics

Aravind Srinivasan

Institution

University of Maryland, College Park

computer science

applied mathematics

Chandra Sekhar Chekuri

Institution

University of Illinois Urbana-Champaign

analysis of algorithm

applied mathematics

Samir Khuller

Institution

University of Maryland, College Park

parallel complexity theory

combinatorial optimization

S. S. Iyengar

Institution

Florida International University

industrial informatics

parallel computing

Joseph S. B. Mitchell

Institution

Stony Brook University

air traffic management

vehicle routing problem