1979
DOI: 10.1016/0141-0296(79)90017-8
|View full text |Cite
|
Sign up to set email alerts
|

Optimal excavation profile for a pipeline freely resting on the sea floor

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
7
0

Year Published

1988
1988
2009
2009

Publication Types

Select...
3
3

Relationship

0
6

Authors

Journals

citations
Cited by 18 publications
(7 citation statements)
references
References 4 publications
0
7
0
Order By: Relevance
“…Another solution strategy is represented by the bi-level formulation of MPEC, see e.g. [7,21]. The so called "bundle method", based on the tools of nondifferentiable analysis, has been proposed in [10].…”
Section: Smoothing Techniquementioning
confidence: 99%
“…Another solution strategy is represented by the bi-level formulation of MPEC, see e.g. [7,21]. The so called "bundle method", based on the tools of nondifferentiable analysis, has been proposed in [10].…”
Section: Smoothing Techniquementioning
confidence: 99%
“…programming problems are also frequently encountered in engineering and physics (cf., e.g., Giannessi et al (1979), Heron and Sermange (1982), Mahjoub (1983), Vidigal and Director (1982), Strodiot et al (1985 and, Polak and Vincentelli (1979), Toland (1978), Tuy (1986 and). programming problems are also frequently encountered in engineering and physics (cf., e.g., Giannessi et al (1979), Heron and Sermange (1982), Mahjoub (1983), Vidigal and Director (1982), Strodiot et al (1985 and, Polak and Vincentelli (1979), Toland (1978), Tuy (1986 and).…”
Section: Complementarity Problems and Concave Minimizationmentioning
confidence: 99%
“…Another example has been discussed in Giannessi et al (1979). In offs hore technology, a submarine pipeline is usually laid so that it rests freely on the sea bot tom.…”
Section: Reverse Convex Constraintsmentioning
confidence: 99%
“…D .c. programming problems are also frequently encountered in engineering and physics (cf., e.g., Giannessi et al [54], Heron …”
Section: Consequentlymentioning
confidence: 99%
“…For concave minimization, biconvex programming, separable programs, and certain quadratic problems, algorithms have frequently used convex envelops @ off over M to obtain P ( M ) = min @(M r l D) (54) (cf. Section 3.1).…”
Section: Outer Approximation In Branch-and-bound Proceduresmentioning
confidence: 99%