Search
Search Results
-
On the approximation ratio threshold for the reoptimization of the maximum number of satisfied equations in linear systems over a finite field
When an arbitrary equation is inserted into a linear system over the field GF(2) that contains exactly 3 variables from the set of n variables in...
-
Approximate dynamic programming for stochastic N-stage optimization with application to optimal consumption under uncertainty
Stochastic optimization problems with an objective function that is additive over a finite number of stages are addressed. Although Dynamic...
-
Network Planning
In this chapter, we present some of the issues involved in the practice of supply chain design and planning. These are issues that are often not...
-
Sensitivity analysis of the knapsack problem: a negative result
We consider the Blair hypothesis on the computational complexity of the problem connected with optimal solutions to the so-called adjacent knapsack...
-
On the existence of polynomial-time approximation schemes for the reoptimization of discrete optimization problems
It is shown that no polynomial-time approximation scheme exists for the reoptimization of the set covering problem in inserting an element into or...
-
An exact cooperative method for the uncapacitated facility location problem
In this paper, we present a cooperative primal-dual method to solve the uncapacitated facility location problem exactly. It consists of a primal...
-
On the safety of Gomory cut generators
Gomory mixed-integer cuts are one of the key components in Branch-and-Cut solvers for mixed-integer linear programs. The textbook formula for...
-
Stoichiometric and Constraint-Based Analysis of Biochemical Reaction Networks
Metabolic network analysis based on stoichiometric and constraint-based methods has become one of the most popular and successful modeling approaches...
-
Space Map** for Electromagnetic-Simulation-Driven Design Optimization
Space map** (SM) has been one of the most popular surrogate-based optimization techniques in microwave engineering to date. By exploiting the...
-
Simulation-Driven Antenna Design Using Surrogate-Based Optimization
Accurate responses of antennas, in many cases, can be obtained only with discrete full-wave electromagnetic (EM) simulations. Therefore, contemporary...
-
Parallel distributed-memory simplex for large-scale stochastic LP problems
We present a parallelization of the revised simplex method for large extensive forms of two-stage stochastic linear programming (LP) problems. These...
-
Design and Implementation of Scheduling Systems: Basic Concepts
Analyzing a scheduling problem and develo** a procedure for dealing with it on a regular basis is, in the real world, only part of the story. The...
-
What Lies Ahead?
This chapter describes various research and development topics that are likely to receive attention in the near future. A distinction is made between...
-
Could we use a million cores to solve an integer program?
Given the steady increase in cores per CPU, it is only a matter of time before supercomputers will have a million or more cores. In this article, we...
-
Design and Implementation of Scheduling Systems: More Advanced Concepts
This chapter focuses on a number of issues that have come up in recent years in the design, development, and implementation of scheduling systems....
-
A stabilized structured Dantzig–Wolfe decomposition method
We discuss an algorithmic scheme, which we call the stabilized structured Dantzig–Wolfe decomposition method, for solving large-scale structured...
-
Linear Programming Relaxations of Quadratically Constrained Quadratic Programs
We investigate the use of linear programming tools for solving semidefinite programming relaxations of quadratically constrained quadratic problems....
-
A Forex trading system based on a genetic algorithm
In this paper, a genetic algorithm will be described that aims at optimizing a set of rules that constitute a trading system for the Forex market....
-
On the probabilistic min spanning tree Problem
We study a probabilistic optimization model for min spanning tree , where any vertex v i of the input-graph G ( V , E ) has some presence probability p ...