全文获取类型
收费全文 | 61篇 |
免费 | 2篇 |
专业分类
化学 | 6篇 |
力学 | 1篇 |
数学 | 43篇 |
物理学 | 13篇 |
出版年
2021年 | 1篇 |
2018年 | 2篇 |
2017年 | 1篇 |
2016年 | 7篇 |
2014年 | 2篇 |
2012年 | 2篇 |
2011年 | 4篇 |
2010年 | 2篇 |
2009年 | 4篇 |
2008年 | 3篇 |
2007年 | 3篇 |
2006年 | 2篇 |
2005年 | 1篇 |
2004年 | 1篇 |
2003年 | 1篇 |
2001年 | 1篇 |
2000年 | 5篇 |
1999年 | 3篇 |
1997年 | 1篇 |
1996年 | 2篇 |
1995年 | 1篇 |
1993年 | 2篇 |
1992年 | 1篇 |
1991年 | 1篇 |
1990年 | 1篇 |
1989年 | 1篇 |
1988年 | 1篇 |
1987年 | 3篇 |
1986年 | 2篇 |
1985年 | 2篇 |
排序方式: 共有63条查询结果,搜索用时 31 毫秒
1.
2.
Through the sol–gel process, using the so-called neutral amine route, spherical particles of 1:1 zirconia–titania were synthesized from zirconium(IV) and titanium(IV) butoxides as well as 1,12-diaminododecane as precursor species. The obtained product exhibited a hexagonal structure, as determinated by X-ray diffraction data. The obtained material was also characterized by thermogravimetry, differential scanning calorimetry, infrared spectroscopy, scanning electron microscopy, and surface area measurements. Despite the release of template molecules on heating, the spherical morphology was retained up to about 1200°C, at which the disruption of the spheres took place. 相似文献
3.
4.
de Farias RF de Souza JM de Melo JV Airoldi C 《Journal of colloid and interface science》1999,212(1):123-129
The effects exhibited by adsorbed conducting polyaniline on the redox process on a molybdenum oxide surface were studied. Thermogravimetric results indicate a 4% polyaniline deposition. Cyclic voltammograms of the adsorbed polymer on MoO3 show that polyaniline exerts remarkable effects on the molybdenum blue oxidation-reduction process, with oxidation and reduction potentials of 0.33 and 0.18 V, respectively. This effect strongly enhances the electrode response, and can be used as an important tool in qualitative and/or quantitative determinations of molybdenum in solution as well as in any substrate. Copyright 1999 Academic Press. 相似文献
5.
Local branching 总被引:1,自引:0,他引:1
The availability of effective exact or heuristic solution methods for general Mixed-Integer Programs (MIPs) is of paramount importance for practical applications. In the present paper we investigate the use of a generic MIP solver as a black-box ``tactical' tool to explore effectively suitable solution subspaces defined and controlled at a ``strategic' level by a simple external branching framework. The procedure is in the spirit of well-known local search metaheuristics, but the neighborhoods are obtained through the introduction in the MIP model of completely general linear inequalities called local branching cuts. The new solution strategy is exact in nature, though it is designed to improve the heuristic behavior of the MIP solver at hand. It alternates high-level strategic branchings to define the solution neighborhoods, and low-level tactical branchings to explore them. The result is a completely general scheme aimed at favoring early updatings of the incumbent solution, hence producing high-quality solutions at early stages of the computation. The method is analyzed computationally on a large class of very difficult MIP problems by using the state-of-the-art commercial software ILOG-Cplex 7.0 as the black-box tactical MIP solver. For these instances, most of which cannot be solved to proven optimality in a reasonable time, the new method exhibits consistently an improved heuristic performance: in 23 out of 29 cases, the MIP solver produced significantly better incumbent solutions when driven by the local branching paradigm.
Mathematics Subject Classification (2000):90C06, 90C10, 90C11, 90C27, 90C59 相似文献
6.
Natashia L. Boland Andrew C. Eberhard Faramroze G. Engineer Matteo Fischetti Martin W. P. Savelsbergh Angelos Tsoukalas 《Mathematical Programming Computation》2014,6(3):255-279
The feasibility pump (FP) has proved to be an effective method for finding feasible solutions to mixed integer programming problems. FP iterates between a rounding procedure and a projection procedure, which together provide a sequence of points alternating between LP feasible but fractional solutions, and integer but LP infeasible solutions. The process attempts to minimize the distance between consecutive iterates, producing an integer feasible solution when closing the distance between them. We investigate the benefits of enhancing the rounding procedure with a clever integer line search that efficiently explores a large set of integer points. An extensive computational study on benchmark instances demonstrates the efficacy of the proposed approach. 相似文献
7.
Pierre Bonami Gérard Cornuéjols Sanjeeb Dash Matteo Fischetti Andrea Lodi 《Mathematical Programming》2008,113(2):241-257
Recent experiments by Fischetti and Lodi show that the first Chvátal closure of a pure integer linear program (ILP) often
gives a surprisingly tight approximation of the integer hull. They optimize over the first Chvátal closure by modeling the
Chvátal–Gomory (CG) separation problem as a mixed integer linear program (MILP) which is then solved by a general- purpose
MILP solver. Unfortunately, this approach does not extend immediately to the Gomory mixed integer (GMI) closure of an MILP,
since the GMI separation problem involves the solution of a nonlinear mixed integer program or a parametric MILP. In this
paper we introduce a projected version of the CG cuts, and study their practical effectiveness for MILP problems. The idea
is to project first the linear programming relaxation of the MILP at hand onto the space of the integer variables, and then
to derive Chvátal–Gomory cuts for the projected polyhedron. Though theoretically dominated by GMI cuts, projected CG cuts
have the advantage of producing a separation model very similar to the one introduced by Fischetti and Lodi, which can typically
be solved in a reasonable amount of computing time.
Gérard Cornuéjols was supported in part by NSF grant DMI-0352885, ONR grant N00014-03-1-0188, and ANR grant BLAN 06-1-138894.
Matteo Fischetti was supported in part by the EU projects ADONET (contract n. MRTN-CT-2003-504438) and ARRIVAL (contract n.
FP6-021235-2). Andrea Lodi was supported in part by the EU projects ADONET (contract n. MRTN-CT-2003-504438) and ARRIVAL (contract
n. FP6-021235-2). 相似文献
8.
In this paper, new lower bounds for the asymmetric travelling salesman problem are presented, based on spanning arborescences. The new bounds are combined in an additive procedure whose theoretical performance is compared with that of the Balas and Christofides procedure (1981). Both procedures have been imbedded in a simple branch and bound algorithm and experimentally evaluated on hard test problems. 相似文献
9.
Given the integer polyhedronP
t
:= conv{x ∈ℤ
n
:Ax⩽b}, whereA ∈ℤ
m × n
andb ∈ℤ
m
, aChvátal-Gomory (CG)cut is a valid inequality forP
1 of the type λτAx⩽⌊λτb⌋ for some λ∈ℝ
+
m
such that λτA∈ℤ
n
. In this paper we study {0, 1/2}-CG cuts, arising for λ∈{0, 1/2}
m
. We show that the associated separation problem, {0, 1/2}-SEP, is equivalent to finding a minimum-weight member of a binary
clutter. This implies that {0, 1/2}-SEP is NP-complete in the general case, but polynomially solvable whenA is related to the edge-path incidence matrix of a tree. We show that {0, 1/2}-SEP can be solved in polynomial time for a
convenient relaxation of the systemAx<-b. This leads to an efficient separation algorithm for a subclass of {0, 1/2}-CG cuts, which often contains wide families of
strong inequalities forP
1. Applications to the clique partitioning, asymmetric traveling salesman, plant location, acyclic subgraph and linear ordering
polytopes are briefly discussed. 相似文献
10.
In this paper we consider the NP-hard problem of finding a feasible solution (if any exists) for a generic MIP problem of the form min{cTx:Ax≥b,xj integer ∀j ∈ }. Trivially, a feasible solution can be defined as a point x* ∈ P:={x:Ax≥b} that is equal to its rounding , where the rounded point is defined by := x*j if j ∈ and := x*j otherwise, and [·] represents scalar rounding to the nearest integer. Replacing “equal” with “as close as possible” relative to a suitable distance function Δ(x*, ), suggests the following Feasibility Pump (FP) heuristic for finding a feasible solution of a given MIP.We start from any x* ∈ P, and define its rounding . At each FP iteration we look for a point x* ∈ P that is as close as possible to the current by solving the problem min {Δ(x, ): x ∈ P}. Assuming Δ(x, ) is chosen appropriately, this is an easily solvable LP problem. If Δ(x*, )=0, then x* is a feasible MIP solution and we are done. Otherwise, we replace by the rounding of x*, and repeat.We report computational results on a set of 83 difficult 0-1 MIPs, using the commercial software ILOG-Cplex 8.1 as a benchmark. The outcome is that FP, in spite of its simple foundation, proves competitive with ILOG-Cplex both in terms of speed and quality of the first solution delivered. Interestingly, ILOG-Cplex could not find any feasible solution at the root node for 19 problems in our test-bed, whereas FP was unsuccessful in just 3 cases. 相似文献