The adjacency relation on the traveling salesman polytope is NP-Complete

We consider the problem of determining whether two traveling salesman tours correspond to non-adjacent vertices of the convex polytope associated with the traveling salesman problem. This problem is shown to be NP-Complete for both the symmetric and nonsymmetric traveling salesman problem. Several implications are discussed.This Research was supported by NSF Grant GK-420488, the U.S. Army Research Office-Durham under Grant DAHC04-75-G0192, and an IBM Fellowship.     

Stability of wavefronts in a variable porosity model

We study the existence and linearized stability of traveling waves to a one-dimensional nonlinear parabolic equation that models the diffusion and convection of a chemical or biological species in a porous domain, where the fraction of volume (porosity) available to the species is a function of its concentration.     

A lifting procedure for the asymmetric traveling salesman polytope and a large new class of facets

Given any family of valid inequalities for the asymmetric traveling salesman polytopeP(G) defined on the complete digraphG, we show that all members of are facet defining if the primitive members of (usually a small subclass) are. Based on this result we then introduce a general procedure for identifying new classes of facet inducing inequalities forP(G) by lifting inequalities that are facet inducing forP(G), whereG is some induced subgraph ofG. Unlike traditional lifting, where the lifted coefficients are calculated one by one and their value depends on the lifting sequence, our lifting procedure replaces nodes ofG with cliques ofG and uses closed form expressions for calculating the coefficients of the new arcs, which are sequence-independent. We also introduce a new class of facet inducing inequalities, the class of SD (source-destination) inequalities, which subsumes as special cases most known families of facet defining inequalities.Research supported by Grant DDM-8901495 of the National Science Foundation and Contract N00014-85-K-0198 of the U.S. Office of Naval Research.Research supported by M.U.R.S.T., Italy.     

A production scheduling heuristic for an electronics manufacturer with sequence-dependent setup costs

In this paper, we develop a three-step heuristic to address a production scheduling problem at a high volume assemble-to-order electronics manufacturer. The heuristic provides a solution for scheduling multiple product families on parallel, identical production lines so as to minimize setup costs. The heuristic involves assignment, sequencing, and time scheduling steps, with an optimization approach developed for each step. For the most complex step, the sequencing step, we develop a greedy randomized adaptive search procedure (GRASP). We compare the setup costs resulting from the use of our scheduling heuristic against a heuristic previously developed and implemented at the electronics manufacturer that assumes approximately equal, sequence-independent, setup costs. By explicitly considering the sequence-dependent setup costs and applying GRASP, our empirical results show a reduction in setups costs for an entire factory of 14–21% with a range of single production line reductions from 0% to 49%.     

Local cuts revisited

We present a variant of the local cut generation procedure by Applegate, Bixby, Chvátal and Cook. Unlike the original procedure, our method immediately yields a facet of the projected polytope as the solution of a single LP, without the need for the time-consuming tilting step. Moreover, our facets have big volume in general.     

New solutions for the modified generalized Degasperis-Procesi equation

In this paper, using three distinct computational methods we obtain some new exact solutions for the generalized modified Degasperis-Procesi equation (mDP equation) u_t-u_xxt+(b+1)u²u_x=bu_xu_xx+uu_xxx. We show the graph of some of the new solutions obtained here with the aim to illustrate their physical relevance. Mathematica is used. Finally some conclusions are given.     

RLW-Burgers方程的一类解析解

本文给出了 RLW-Burgers方程及 Kd V-Burgers方程的一类解析解 ,且可得到 RLW-Burgers方程的振荡激波解 .这些解可以表示为 Burgers方程和 Kd V方程解的线性组合 ,文末还对文 [8]作了讨论 .     

Traveling Wave Fronts of a Degenerate Parabolic Equation with Non-divergence Form

We study the traveling wave solutions of a nonlinear degenerate parabolic equation with non-divergence form. Under some conditions on the source, we establish the existence, and then discuss the regularity of such solutions.     

行波管用钨铼合金中高含量铼的X射线荧光光谱测定

根据行波管用的关键材料-钨铼合金中高含量铼测定的需求,研究了用X射线荧光(XRF)光谱法测定铼时所存在的基体效应、谱线重叠和背景干扰的影响,从理论上解释了XRF二元比例法校正曲线线性差的原因。理论和实验结果均表明：直接用Re Lα分析线强度绘制的校正曲线比二元比例法可以获得更好的线性。本法具有快速准确的特点,分析结果与化学方法一致,在生产控制中应用效果显著。