The Internet Archive has a preservation copy of this work in our general collections.
The file type is `application/pdf`

.

## Filters

##
###
A linear program for testing local realism
[article]

2009
*
arXiv
*
pre-print

If the correlations cannot be described under the assumption of local realism, the

arXiv:0905.2950v1
fatcat:a4zit5simzgpvp4mnaegfwqkoa
*program*outputs a Bell inequality*violated*by the correlations. ... We present a*linear**program*that is capable of determining whether a set of correlations can be captured by a local realistic model. ... This*linear**program*gives us a method for determining whether a set of correlations*violates*local realism. ...##
###
Linear programming in low dimensions
[chapter]

2011
*
Mathematical Surveys and Monographs
*

Next, we show how to extend this algorithm to solve

doi:10.1090/surv/173/15
fatcat:yak7b6czabgurb4xxff65uhkvq
*linear**programming*with*violations*. ... Finally, we would show how one can efficiently approximate the number constraints one need to*violate*to make a*linear**program*feasible. ...*Linear**Programming*with*Violations*Let L be a*linear**program*with d variables, and*k*> 0 be a parameter. We are interested in the optimal solution of L if we are allowed to throw away*k*constraints. ...##
###
K-Sum Linear Programming

1992
*
Journal of the Operational Research Society
*

For

doi:10.1057/jors.1992.51
fatcat:uho5tlwhz5cudns5hvy7l2fw4i
*k*=n, LP(*k*) reduces to the classical*linear**programming*problem? and for*k*= 1, it reduces to the minmax*linear**programming*problem". ... Thus, LP(*k*) simultaneously generalizes both the*linear**programming*and the minmax*linear**programming*problem. ...##
###
K-Sum Linear Programming

1992
*
Journal of the Operational Research Society
*

For

doi:10.1038/sj/jors/0430408
fatcat:dkrgczexlbcnli2iqsb4ymvh4e
*k*=n, LP(*k*) reduces to the classical*linear**programming*problem? and for*k*= 1, it reduces to the minmax*linear**programming*problem". ... Thus, LP(*k*) simultaneously generalizes both the*linear**programming*and the minmax*linear**programming*problem. ...##
###
A Cutting Plane Algorithm for the Single Machine Scheduling Problem with Release Times
[chapter]

1992
*
Combinatorial Optimization
*

For the general problem, good lower bounds are obtained by adding additional valid inequalities that are

doi:10.1007/978-3-642-77489-8_4
fatcat:kev7eo5mnnbmrnnoxqytmb7va4
*violated*by the solution to the*linear**programming*relaxation. ... For the general problem, good lower bounds are obtained by adding additional valid inequalities that are*violated*by the solution to the*linear**programming*relaxation. ... If any*violated*triangle inequalities are found, add them to the current*linear**program*and go to step l. 4. ...##
###
Page 7566 of Mathematical Reviews Vol. , Issue 2001J
[page]

2001
*
Mathematical Reviews
*

., 1084, Springer, Berlin, 1996; MR 98a:05134], we restrict to maximally

*violated*cuts, i.e., to inequalities which are*violated*by (*k*— 1)/*k*by the given frac- tional point. ... , Adam N. (4-LANC-MG; Lancaster) On the separation of maximally*violated*mod-*k*cuts. ...##
###
Page 360 of The Journal of the Operational Research Society Vol. 43, Issue 4
[page]

1992
*
The Journal of the Operational Research Society
*

Journal of the Operational Research Society Vol. 43, No. 4

*linear**programming*equivalent of LP(*k*) has an exponential number of constraints. ... This shows the classroom value of LP(*k*). SOLUTION STRATEGY It is easy to see that LP(*k*) is equivalent to the following*linear**program*: LP: minimize y subject to AX >b >) Gx —» <0; RSE 2, 2.005." ...##
###
A fast on-chip decoupling capacitance budgeting algorithm using macromodeling and linear programming

2006
*
Proceedings of the 43rd annual conference on Design automation - DAC '06
*

To reduce the error caused by

doi:10.1145/1146909.1146967
dblp:conf/dac/ZhaoPSYF06
fatcat:35sr5nvpyzhcdehbpxkd5gmqfe
*linearization*, we do multiple iterations of the*linear**program*. ... We formulate the nonlinear optimization into a*linear**program*(LP) by integrating the nodal equations across a time period of interest and through certain approximations. ... into a*linear**programming*formulation minimize È i∈SP Ci (9) subject to M • C ≥ A · W + B W ≥ L È*k*∈tile i C*k*≤ Cmax,i, ∀tile i ∈*violation*region, where m = |SP |, C = [C1, C2, .., Cm] T , M = ¾ Vo, ...##
###
Testing atomicity of composed concurrent operations

2011
*
Proceedings of the 2011 ACM international conference on Object oriented programming systems languages and applications - OOPSLA '11
*

Using COLT, we found 56 atomicity

doi:10.1145/2048066.2048073
dblp:conf/oopsla/ShachamBASVY11
fatcat:j4npwnunmzg3pn2qrj463dt7vu
*violations*in Apache Tomcat, Cassandra, MyFaces Trinidad, and other applications. ... We implemented our approach in a tool called COLT, and evaluated its effectiveness on a range of 51 realworld concurrent Java*programs*. ... Function add receives an input key*k*and in case that*k*is not already in m adds*k*to m with the value 2. In this function the user provided two conditional*linearization*points. ...##
###
Testing atomicity of composed concurrent operations

2011
*
SIGPLAN notices
*

Using COLT, we found 56 atomicity

doi:10.1145/2076021.2048073
fatcat:jynxahx7hzfptpfc2t55ukdll4
*violations*in Apache Tomcat, Cassandra, MyFaces Trinidad, and other applications. ... We implemented our approach in a tool called COLT, and evaluated its effectiveness on a range of 51 realworld concurrent Java*programs*. ... Function add receives an input key*k*and in case that*k*is not already in m adds*k*to m with the value 2. In this function the user provided two conditional*linearization*points. ...##
###
An efficient decoupling capacitance optimization using piecewise polynomial models

2009
*
2009 Design, Automation & Test in Europe Conference & Exhibition
*

But different from the existing work [12], the new method applies the more accurate piecewise polynomial micromodels to estimate the voltage noises during the

doi:10.1109/date.2009.5090843
dblp:conf/date/WangCTHR09
fatcat:lndafpstvvfn5f6qtaarmwisgu
*linear**programming*process. ... If no*violation*is found, the optimization ends ; For each*violation*region, determine the optimal amount of decap by 3*linear**programming*or sequential*linear**programming*; Distribute the decap of the ... with a*linear**programming*problem: min i∈s c i (4) s.t. ...##
###
A Branch-and-Cut Approach to Physical Mapping of Chromosomes by Unique End-Probes

1997
*
Journal of Computational Biology
*

This a ords the signi cant advantage of allowing the well-developed tools of integer

doi:10.1089/cmb.1997.4.433
pmid:9385538
fatcat:4cnna4aq45gm3mepesygcnmpzm
*linear*-*programming*and branch-and-cut algorithms to be brought to bear on physical mapping, enabling us for the rst ... Incorporating the new inequalities The process of identifying an inequality from the complete*linear*description that is*violated*by a fractional solution of the current*linear**programming*relaxation is ... b ijk counts whether betweenness constraint (i; j;*k*) is*violated*. ...##
###
CP violating effects in the decay Z→μ+μ−γ induced by ZZγ and Zγγ couplings

2005
*
Physics Letters B
*

We analyze possible CP-

doi:10.1016/j.physletb.2005.01.039
fatcat:f4eq6u6vbnfrpppugfrjvmuaqy
*violating*effects induced in the Z decay with hard photon radiation by γ ZZ and γγ Z anomalous vertices. ... We find that a*linear*collider with an integrated luminosity of 500 fb^-1 and √(s) = 0.05 TeV can place the bound |h_1^γ,Z| < 0.92 at the 90 confidence level for these couplings. ... The following CP-odd observables have been proposed [10] to search for CP-*violation*in this radiative decay T = (*k*µ + −*k*µ − ) ·p e + (*k*µ + ×*k*µ − ) ·p e + , (2) V = (*k*µ + ×*k*µ − ) ·p e + , wherek ...##
###
Interval Recourse Linear Programming for Resources and Environmental Systems Management under Uncertainty

2015
*
Journal of Environmental Informatics
*

Based on a review of interval

doi:10.3808/jei.201500312
fatcat:6jelft3i6vep7evqzbdkg3cssm
*linear**programming*(ILP) and its significances to REM, two*linear**programming*sub-models are employed to initialize a decision space in IRLP. ... As a recourse measure to resolve constraint*violation*problems, another two*linear**programming*sub-models are constructed given a series of contraction ratios. ... Acknowledgments: This research was supported by the*Program*for Innovative Research Team in University (IRT1127), the 111 Project (B14008) and the Natural Science and Engineering Research Council of Canada ...##
###
Optimal Sparse Kernel Learning for Hyperspectral Anomaly Detection
[article]

2015
*
arXiv
*
pre-print

Due to the prohibitively high computational complexity of the MIP, it is relaxed into a Quadratically Constrained

arXiv:1506.02585v1
fatcat:lo5kgriffjashilq6utq67raz4
*Linear**Programming*(QCLP) problem. ... In this work, optimal sparse feature selection for anomaly detection is first modeled as a Mixed Integer*Programming*(MIP) problem. ... In order to solve this problem, it can be converted into a Quadratically Constrained*Linear**Programming*(QCLP). ...
« Previous

*Showing results 1 — 15 out of 197,794 results*