Browse Papers
From IFORS
Contact Us
English
Remember me
Login
Forgot password?
Keyword: optimization
Found
2864 papers
in total
Date Descending
Date Ascending
Title Descending
Title Ascending
Higher‐level RLT or disjunctive cuts based on a partial enumeration strategy for 0‐1 mixed‐integer programs
2012,
Sherali Hanif
In this paper, we consider the generation of disjunctive cuts for 0‐1...
Stochastic portfolio optimization with proportional transaction costs: Convex reformulations and computational experiments
2012,
Lejeune Miguel A
We propose a probabilistic version of the Markowitz portfolio problem with...
Biased random‐key genetic algorithms with applications in telecommunications
2012,
Resende Mauricio
This paper surveys several applications of biased random‐key genetic algorithms...
Algorithms for linear programming with linear complementarity constraints
2012,
Jdice Joaquim
Linear programming with linear complementarity constraints (LPLCC) is an area of...
Stackelberg Network Pricing Games
2012,
Hoefer Martin
We study a multi‐player one‐round game termed Stackelberg Network...
An O(n+m) Certifying Triconnnectivity Algorithm for Hamiltonian Graphs
2012,
Mehlhorn Kurt
A graph is triconnected if it is connected, has at least 4 vertices and the removal of...
Divide‐and‐Conquer Algorithms for Partitioning Hypergraphs and Submodular Systems
2012,
Nagamochi Hiroshi
The submodular system k ‐partition problem is a problem of partitioning a given...
On the Complexity of Optimal Hotlink Assignment
2012,
Jacobs Tobias
The concept of hotlink assignment aims at reducing the navigation effort for users of...
A Weakly Robust PTAS for Minimum Clique Partition in Unit Disk Graphs
2012,
Pirwani Imran
We consider the problem of partitioning the set of vertices of a given unit disk graph...
A Linear‐Time Algorithm for Star‐Shaped Drawings of Planar Graphs with the Minimum Number of Concave Corners
2012,
Nagamochi Hiroshi
A star‐shaped drawing of a graph is a straight‐line drawing such that...
Schnyder Decompositions for Regular Plane Graphs and Application to Drawing
2012,
Bernardi Olivier
Schnyder woods are decompositions of simple triangulations into three...
Necessary and Sufficient Constraint Qualification for Surrogate Duality
2012,
Suzuki Satoshi
In mathematical programming, constraint qualifications are essential elements for...
Approximate Level Method for Nonsmooth Convex Minimization
2012,
Richtrik Peter
In this paper, we propose and analyse an approximate variant of the level method of...
Normal Feedback Stabilization of Periodic Flows in a Two‐Dimensional Channel
2012,
Munteanu Ionut
We consider a two‐dimensional incompressible channel flow with periodic...
The Lie‐Group Shooting Method for Solving Multi‐dimensional Nonlinear Boundary Value Problems
2012,
Liu Chein-Shan
This paper presents a Lie‐group shooting method for the numerical solutions of...
Global Synchronization Stability for Stochastic Complex Dynamical Networks with Probabilistic Interval Time‐Varying Delays
2012,
Li Hongjie
The synchronization problem for a class of complex dynamical networks with stochastic...
Nonlinear optimal feedback control for lunar module soft landing
2012,
Zhou Jingyang
In this paper, the task of achieving the soft landing of a lunar module such that the...
On zero duality gap in nonconvex quadratic programming problems
2012,
Li D
We present in this paper new sufficient conditions for verifying zero duality gap in...
Minimum recession‐compatible subsets of closed convex sets
2012,
Sun Jie
A subset B of a closed convex set A is recession‐compatible with respect to A...
Robust dynamical compensator design for discrete‐time linear periodic systems
2012,
Lv Lingling
This paper considers dynamical compensators design for purpose of pole assignment for...
An adaptive least‐squares collocation radial basis function method for the HJB equation
2012,
Alwardi H
We present a novel numerical method for the Hamilton–Jacobi–Bellman...
Efficient Parallel Algorithms for Planar st‐Graphs
2003,
Chen
Planar st ‐graphs find applications in a number of areas. In this paper we...
A Characterization of Planar Graphs by Pseudo‐Line Arrangements
2003,
Tokuyama Takeshi
Let Γ be an arrangement of pseudo‐lines, i.e., a collection of unbounded...
Polynomial Time Algorithms for 2‐Edge‐Connectivity Augmentation Problems
2003,
Galluccio
Given a 2‐edge‐connected, real weighted graph G with n vertices and m...
First Page
46
47
48
49
50
Last Page
Papers per page:
6 Papers
12 Papers
24 Papers
36 Papers
48 Papers