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, 4 months
  • Last seen this week
12 votes
3 answers
6k views

How to find all vertices of a polyhedron

8 votes
4 answers
659 views

Algorithm for simplifying a set of linear inequalities

7 votes
2 answers
616 views

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

6 votes
2 answers
396 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

6 votes
1 answer
376 views

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

5 votes
0 answers
50 views

Constant-factor approximation algorithms for max-min number partitioning

5 votes
2 answers
739 views

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

4 votes
1 answer
318 views

Optimization problem with the Harmonic number

4 votes
1 answer
126 views
+50

Applications where a very high numeric accuracy is required

3 votes
3 answers
908 views

Do convex quadratic problems always have sparse solutions?

3 votes
1 answer
126 views

How is semidefinite programming a special case of convex programming?

3 votes
1 answer
1k views

Efficient solver for multiway number partitioning

3 votes
1 answer
976 views

How to minimize the sum of absolute values

3 votes
3 answers
369 views

Upper bound on length of solution of linear program

2 votes
1 answer
97 views

Basic question about definition of a convex optimization problem

2 votes
1 answer
78 views

Reducing optimality to feasibility in non-linear programs

2 votes
0 answers
134 views

Maximizing the minimum machine completion time

2 votes
1 answer
130 views

How to generate hard instances for number partitioning?

2 votes
2 answers
199 views

A branch-and-bound algorithm for number partitioning

1 vote
1 answer
120 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
56 views

Convex programming without a lower bound on the feasible region size

0 votes
0 answers
70 views

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