Erel Segal-Halevi's user avatar
Erel Segal-Halevi's user avatar
Erel Segal-Halevi's user avatar
Erel Segal-Halevi
  • Member for 4 years, 1 month
  • Last seen this week
12 votes
3 answers
6k views

How to find all vertices of a polyhedron

8 votes
4 answers
649 views

Algorithm for simplifying a set of linear inequalities

7 votes
2 answers
609 views

Can a generic ILP solver find graph matchings as fast as a specialized algorithm?

6 votes
1 answer
349 views

How to solve this linear program with an exponential number of constraints?

6 votes
2 answers
368 views

How to represent a constraint on the kth-smallest function?

6 votes
3 answers
1k views

Finding a solution to a linear program with a small number of zeros

5 votes
0 answers
49 views

Constant-factor approximation algorithms for max-min number partitioning

5 votes
2 answers
694 views

How can I move from an optimal feasible solution to an optimal basic feasible solution?

3 votes
1 answer
979 views

Efficient solver for multiway number partitioning

3 votes
1 answer
95 views

Optimization problem with the Harmonic number

3 votes
1 answer
880 views

How to minimize the sum of absolute values

2 votes
0 answers
127 views

Maximizing the minimum machine completion time

2 votes
1 answer
118 views

How to generate hard instances for number partitioning?

2 votes
2 answers
183 views

A branch-and-bound algorithm for number partitioning

2 votes
3 answers
337 views

Upper bound on length of solution of linear program

2 votes
1 answer
88 views

Basic question about definition of a convex optimization problem

2 votes
1 answer
74 views

Reducing optimality to feasibility in non-linear programs

2 votes
0 answers
43 views

Finding an interior point in a convex region

1 vote
1 answer
112 views

Anytime solver for integer linear program

1 vote
0 answers
52 views

What is the use of solvers that return approximately-feasible solutions?

1 vote
0 answers
51 views
+50

Convex programming without a lower bound on the feasible region size

0 votes
0 answers
47 views

Solving a max-min convex optimization problem with interior-point methods