ORL 2008 - PDF Preprint Papers

ORL 2008

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed ORL-2008 Paper

click to vote

ORL
2008

160views more ORL 2008»

Efficient nested pricing in the simplex algorithm

13 years 11 months ago

Download www.optimization-online.org

We report a remarkable success of nested pricing rules over major pivot rules commonly used in practice, such as Dantzig's original rule as well as the steepest-edge rule and ...

Ping-Qi Pan

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	160	Efficient nested pricing in the simplex algorithm	claim
2	124	Sample average approximation of expected value constrained stochastic programs	claim
3	120	Composition of stable set polyhedra	claim
4	116	Explicit gradient information in multiobjective optimization	claim
5	115	Maximum algebraic connectivity augmentation is NP-hard	claim
6	115	On the convergence of stochastic dual dynamic programming and related methods	claim
7	112	A monotone approximation algorithm for scheduling with precedence constraints	claim
8	111	New formulations and valid inequalities for a bilevel pricing problem	claim
9	111	Certificates of linear mixed integer infeasibility	claim
10	108	Mechanism design for a multicommodity flow game in service network alliances	claim
11	106	Computing shortest heterochromatic monotone routes	claim
12	101	Gear composition and the stable set polytope	claim
13	101	Adaptive search with stochastic acceptance probabilities for global optimization	claim
14	99	Some tractable instances of interval data minmax regret problems	claim
15	96	A power penalty method for linear complementarity problems	claim
16	95	Online scheduling of parallel jobs on two machines is 2-competitive	claim
17	93	Polymatroids and mean-risk minimization in discrete optimization	claim
18	91	On the integrality ratio for tree augmentation	claim
19	90	Optimal bundle pricing with monotonicity constraint	claim
20	88	Approximating integrals of multivariate exponentials: A moment approach	claim
21	87	On-line scheduling with non-crossing constraints	claim
22	86	A redundant Klee-Minty construction with all the redundant constraints touching the feasible region	claim
23	86	Searching the k-change neighborhood for TSP is W[1]-hard	claim
24	82	An approximation algorithm for the wireless gathering problem	claim
25	82	On test sets for nonlinear integer maximization	claim
26	77	A risk-averse newsvendor with law invariant coherent measures of risk	claim
27	77	A short proof of the VPN Tree Routing Conjecture on ring networks	claim
28	74	Bounds on the size of branch-and-bound proofs for integer knapsacks	claim
29	73	Solving operational statistics via a Bayesian analysis	claim
30	73	Polytopes and arrangements: Diameter and curvature	claim
31	72	Stochastic 0-1 linear programming under limited distributional information	claim
32	71	A fixed point theorem for discontinuous functions	claim
33	71	A note on polling models with renewal arrivals and nonzero switch-over times	claim
34	70	Efficiently packing unequal disks in a circle	claim
35	70	Finding a bounded mixed-integer solution to a system of dual network inequalities	claim
36	68	On polynomial cases of the unichain classification problem for Markov Decision Processes	claim
37	67	Bounds on the performance of back-to-front airplane boarding policies	claim
38	66	Profit-based latency problems on the line	claim
39	63	The inequality-satisfiability problem	claim
40	63	Approximate formulations for 0-1 knapsack sets	claim
41	60	To match or not to match: Aspects of marital matchmaking under uncertainty	claim
42	60	Lot-sizing on a tree	claim
43	58	Source location in undirected and directed hypergraphs	claim
44	55	Policies utilizing tactical inventory for service-differentiated customers	claim
45	54	A note on the MIR closure	claim
46	52	Supplier diversification under binomial yield	claim
47	51	A note on characterizations of the Natvig structure functions	claim
48	50	Exploiting equalities in polynomial programming	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers