• No results found

integer programs

Solution methods and bounds for two-stage risk-neutral and multistage risk-averse stochastic mixed-integer programs with applications in energy and manufacturing

Solution methods and bounds for two-stage risk-neutral and multistage risk-averse stochastic mixed-integer programs with applications in energy and manufacturing

... allow for the employment of scenario decomposition solution algorithms, such as the PH algorithm, to efficiently solve multistage risk-averse problems. However, approaches to assess PH solution quality for risk-averse ...

113

Triangulation of Input–Output Tables Based on Mixed Integer Programs for Inter-temporal and Inter-regional Comparison of Production Structures

Triangulation of Input–Output Tables Based on Mixed Integer Programs for Inter-temporal and Inter-regional Comparison of Production Structures

... Abstract Understanding the industrial structure of a national or regional economy is one of the central issues in economics. The triangulation of an input–output table (IOT) can be employed to understand the production ...

19

Algorithms for Stochastic Integer Programs Using Fenchel Cutting Planes

Algorithms for Stochastic Integer Programs Using Fenchel Cutting Planes

... This dissertation develops theory and methodology based on Fenchel cutting planes for solving stochastic integer programs (SIPs) with binary or general integer variables in the second-stage. The ...

130

Solving Packing Integer Programs via Randomized Rounding with Alterations

Solving Packing Integer Programs via Randomized Rounding with Alterations

... Our second result is for the class of packing integer programs (PIPs) that are column sparse, i. e., where there is a specified upper bound k on the number of constraints that each variable appears in. We ...

33

Obtaining lower bounds from the progressive hedging algorithm for stochastic mixed-integer programs

Obtaining lower bounds from the progressive hedging algorithm for stochastic mixed-integer programs

... (mixed-) integer programs arise in a variety of situations in which discrete decisions combine with uncertainty in the ...of integer and mixed-integer problems makes them difficult to solve ...

25

Alternating runtime and size complexity analysis of integer programs

Alternating runtime and size complexity analysis of integer programs

... 682 programs from the literature on termination and complexity of integer ...C programs, we used the tool KITTeL [19] to transform them into integer programs ...

16

Analyzing runtime and size complexity of integer programs

Analyzing runtime and size complexity of integer programs

... C programs, we used the tool KITTeL [Falke et ...into integer programs ...different integer program formats provided by the authors of the respective tools (in the case of PUBS and CoFloCo) or ...

49

Solving Stochastic and Bilevel Programs Using Value Functions of Integer Programs.

Solving Stochastic and Bilevel Programs Using Value Functions of Integer Programs.

... second-stage integer program in the absence of ...linear programs with pure-integer first- and second-stage ...linear integer programs are derived and used to construct value functions ...

102

Reformulation and decomposition of integer programs

Reformulation and decomposition of integer programs

... In this survey we examine ways to reformulate integer and mixed integer programs. Typically, but not exclusively, one reformulates so as to obtain stronger linear programming relaxations, and hence ...

88

Subgradient-based Decomposition Methods for Stochastic Mixed-integer Programs with Special Structures

Subgradient-based Decomposition Methods for Stochastic Mixed-integer Programs with Special Structures

... result in an objective value that is at least 10 - 15% higher than optimal. This phenomenon is expected in these types of problems, as the solution to a stochastic integer program gen- erally gives a more robust ...

121

Research Article A Parallelized Variable Fixing Process for Solving Multistage Stochastic Programs with Progressive Hedging

Research Article A Parallelized Variable Fixing Process for Solving Multistage Stochastic Programs with Progressive Hedging

... Benders decomposition (BD) is a delayed constraint generation approach for solving mixed integer programs. It has been mainly applied to two-stage stochastic program- ming problems with some assumptions on ...

17

Dynamic Capacity Acquisition and Assignment under Uncertainty

Dynamic Capacity Acquisition and Assignment under Uncertainty

... stochastic integer programs attempt to partition the space of first stage variables into (hyper)rectangular ...stochastic integer program with mixed-integer first-stage variables, and pure ...

18

Exact Algorithms for the Graph Coloring Problem

Exact Algorithms for the Graph Coloring Problem

... In this section, we present the algorithms that solve graph coloring instances as integer linear programs, which are based in the previous work of Mehrotra and Trick [26]. We first show some definitions of ...

17

Vol 11, No 9 (2020)

Vol 11, No 9 (2020)

... in integer linear programming with new efficient censored is designated to generate all integer competent explanation of ...with integer as well as zero-one decision variable can be explained by the ...

6

C LANGUAGE TUTORIAL. Version Sept 8, 1996

C LANGUAGE TUTORIAL. Version Sept 8, 1996

... most programs spend 90 percent of their operating time in only 10 percent or less of the code, it is possible to write a program in C, then rewrite a small portion of the code in Assembly Language and approach the ...

114

COMPUTER SCIENCE 1999 (Delhi Board)

COMPUTER SCIENCE 1999 (Delhi Board)

... an integer from AR with the help of Binary search method, returning an integer 0 to show absence of the number and integer 1 to show presence of the number in the ...

5

On the interplay of Mixed Integer Linear, Mixed Integer Nonlinear and Constraint Programming

On the interplay of Mixed Integer Linear, Mixed Integer Nonlinear and Constraint Programming

... such has exactly one intersection point with the strictly increasing function on the left-hand side. Such considerations, leading to Theorem 2.1, and resulting methods are implemented in widely used software packages ...

198

Visual BasicTM Routine for In Place Matrix Inversion

Visual BasicTM Routine for In Place Matrix Inversion

... DasGupta, P.E., M.Tech., M.ASCE, MCP 'Legend: 'iNmat = Matrix size 'arrMatrix = Matrix array Dim iRow As Integer, jCol As Integer, iCycle As Integer Dim dPivot As Double, dAbsDiag As Dou[r] ...

10

Negative binomial quasi likelihood inference for general integer valued time series models

Negative binomial quasi likelihood inference for general integer valued time series models

... speci…c integer-valued models such as the Poisson and negative binomial INGARCH models and also to the Double Poisson INGARCH, the Generalized Poisson INGARCH and the INAR ...the Integer-valued ARMA ...

55

2010 09 14 Network Programming Part1 pdf

2010 09 14 Network Programming Part1 pdf

... Integer Long integer Floating point String Complex Boolean List Dictionary Set Apinun, IntERLab... Integer, floating point and string data types The type function tells you the object’s [r] ...

73

Show all 10000 documents...

Related subjects