Boros Endre

Endre Boros

Information about the author Endre Boros will soon be added to the site.
Found 17 papers in total
Vector connectivity in graphs
Vector connectivity in graphs
2014
Motivated by challenges related to domination, connectivity, and information...
On Canonical Forms for Zero‐Sum Stochastic Mean Payoff Games
On Canonical Forms for Zero‐Sum Stochastic Mean Payoff Games
2013
We consider two‐person zero‐sum mean payoff undiscounted stochastic...
The negative cycles polyhedron and hardness of checking some polyhedral properties
The negative cycles polyhedron and hardness of checking some polyhedral properties
2011
Given a graph G =( V , E ) and a weight function on the edges w : E →ℝ, we...
Optimal sequential inspection policies
Optimal sequential inspection policies
2011
We consider the problem of combining a given set of diagnostic tests into an...
Logical analysis of data: classification with justification
Logical analysis of data: classification with justification
2011
Learning from examples is a frequently arising challenge, with a large number of...
A max-flow approach to improved lower bounds for quadratic unconstrained binary optimization (QUBO)
A max-flow approach to improved lower bounds for quadratic unconstrained binary optimization (QUBO)
2008
The ‘roof dual’ of a QUBO (Quadratic Unconstrained Binary Optimization)...
Scheduling vessels and container-yard operations with conflicting objectives
Scheduling vessels and container-yard operations with conflicting objectives
2008
We consider the problem of coordinating the operations of two supply chain partners: a...
Enumerating spanning and connected subsets in graphs and matroids
Enumerating spanning and connected subsets in graphs and matroids
2007
We show that enumerating all minimal spanning and connected subsets of a given matroid...
Local search heuristics for Quadratic Unconstrained Binary Optimization (QUBO)
Local search heuristics for Quadratic Unconstrained Binary Optimization (QUBO)
2007
We present a family of local-search-based heuristics for Quadratic Unconstrained...
Optimal cell flipping to minimize channel density in VLSI design and pseudo-Boolean optimization
Optimal cell flipping to minimize channel density in VLSI design and pseudo-Boolean optimization
1999
Cell flipping in VLSI design is an operation in which some of the cells are replaced...
Logical analysis of numerical data
Logical analysis of numerical data
1997
‘Logical analysis of data’ (LAD) is a methodology developed since the late...
Unconstrained multilayer switchbox routing
Unconstrained multilayer switchbox routing
1995
Consider the gradually more and more complex problems of single row routing, channel...
On the existence of a feasible flow in a stochastic transportation network
On the existence of a feasible flow in a stochastic transportation network
1991
Many transportation networks, e.g., networks of cooperating power systems, and...
The max-cut problem and quadratic 0-1 optimization; polyhedral aspects, relaxations and bounds
The max-cut problem and quadratic 0-1 optimization; polyhedral aspects, relaxations and bounds
1991
Given a graph G , the maximum cut problem consists of finding the subset S of vertices...
Probabilistic bounds and algorithms for the maximum satisfiability problem
Probabilistic bounds and algorithms for the maximum satisfiability problem
1989
In this paper the authors present a new method to analyze and solve the maximum...
On clustering problems with connected optima in Euclidean spaces
On clustering problems with connected optima in Euclidean spaces
1989
Let X be a finite subset of a Euclidean space, and ρ be a real function defined on...
Closed form two-sided bounds for probabilities that at least r and exactly r out of n events occur
Closed form two-sided bounds for probabilities that at least r and exactly r out of n events occur
1989
In two previous papers Prékopa gave algorithms to approximate probabilities...
Papers per page: